Abstract
In this paper we present some parallel algorithms for matrix addition, matrix multiplication, Gaussian elimination, and other related computations on sparse matrices. Our algorithms are designed for the hypercube and related networks, but they can be easily implemented on any other local memory machine. We prove that, under certain assumptions, on a hypercube or related network with p processors our algorithms achieve a speedup proportional to p/log p.
Lingua originale | Inglese |
---|---|
pagine (da-a) | 169-183 |
Numero di pagine | 15 |
Rivista | Journal of Parallel and Distributed Computing |
Volume | 21 |
Numero di pubblicazione | 2 |
DOI | |
Stato di pubblicazione | Pubblicato - mag 1994 |
Pubblicato esternamente | Sì |