Summary: We propose in this paper a new parallel algorithm for computing the matrix-vector product on a ring of \(p\) processors. This solution allows to overlap as much communications as possible. Some simulations and experiments on a Paragon are given in order to confirm the interest in this algorithm.