PARALLEL MATRIX-VECTOR PRODUCT ON RINGS WITH A MINIMUM OF COMMUNICATIONS

Authors
COLOMBET L MICHALLON P TRYSTRAM D
Citation
L. Colombet et al., PARALLEL MATRIX-VECTOR PRODUCT ON RINGS WITH A MINIMUM OF COMMUNICATIONS, Parallel computing, 22(2), 1996, pp. 289-310
Citations number
16
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Parallel computing → ACNP
ISSN journal
01678191
Volume
22
Issue
2
Year of publication
1996
Pages
289 - 310
Database
ISI
SICI code
0167-8191(1996)22:2<289:PMPORW>2.0.ZU;2-F
Abstract
We propose in this paper a new parallel algorithm for computing the ma trix-vector product on a ring of p processors. This solution allows to overlap as much communications as possible. Some simulations and expe riments on a Paragon are given in order to confirm the interest in thi s algorithm.