Parallel matrix-vector product on rings with a minimum of communications. (English) Zbl 0875.68520
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.
MSC:
68W15 | Distributed algorithms |
68Q10 | Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) |