Load-balanced sparse matrix-vector multiplication on parallel computers

Journal of Parallel and Distributed Computing

Volumn 46, Issue 2, 1997, Pages 180-193

  Nastea, Sorin G ^a   Frieder, Ophir ^b   El Ghazawi, Tarek ^b  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

^b FLORIDA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Sparse matrix vector; multiplication; load balancing; parallel computations; greedy allocation; optimized message passing

Indexed keywords

EID: 0007127698     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1997.1361     Document Type: Article

References (20)

1. J. I. Aliaga, V. Hernandez, 1992, Symmetric sparse matrix-vector product on distributed memory multiprocessors, Conference on Parallel Computing and Transputer Applications, Barcelona, Spain.
2. C. A. Alonso Sanches, S. W. Song, 1994, SIMD matrix multiplication on the hypercube, 8th International Parallel Processing Symposium, April 26-29, Cancun, Mexico.
3. Bjorstad P., Manne F., Sorevik T., Vajtersic M. Efficient matrix multiplication on SIMD computers. SIAM J. Matrix Anal. Appl. 33:1992.
4. F. Bodin, J. Erhel, T. Priol, 1993, Parallel sparse matrix vector multiplication using a shared virtual memory environment, Proc. 6th SIAM Conference on Parallel Processing for Scientifical Computing.
5. Dongarra J. J., Gustavson F. G., Karpa A. Implementing linear algebra algorithms for dense matrices on a vector pipeline machine. SIAM Rev. 26:1984.
6. Duff I. S., Grimes R. G., Lewis J. G. Sparse matrix test problems. ACM Trans. Math. Software. 15:1989;1-14.
7. Duff I. S., Grimes R. G., Lewis J. G. User's guide for the Harwell-Boeing sparse matrix collection. CERFACS Report. TR/PA/92/86:1992.
8. Frieder O., Topkar V. A., Karne R. K., Sood A. K. Experimentation with hypercube database engines. IEEE MICRO. Feb. 1992.
9. Friesen D. K., Langstron M. A. Variable sized bin packing. SIAM J. Comput. 15:Feb. 1994.
10. J. G. Lewis, R. A. van de Geijn, 1993, Distributed memory matrix-vector multiplication and conjugate gradient algorithms, Proc. Supercomputing '93.
11. C.-Y. Kao, F.-T. Lin, March 1993, A stochastic approach to the one-dimensional bin-packing problem, Proc. 9th Conference on Artificial Intelligence for Applications, Orlando, FL.
12. Murgolo F. D. An efficient approximation scheme for variable-sized bin packing. SIAM J. Comput. 16:Feb. 1994.
13. S. G. Nastea, O. Frieder, T. El-Ghazawi, 1995, Sparse matrix multiplication on parallel computers, Proc. 10th International Conference on Control Systems and Computer Science, Bucharest, Romania.
14. S. G. Nastea, T. El-Ghazawi, O. Frieder, 1996, Parallel input/output impact on sparse matrix compression, Proc. IEEE Data Compression Conference, Snowbird, UT.
15. Ogielski A. T., Aielo W. Sparse matrix computations on parallel processor arrays. SIAM J. Scientific Comput. 1993.
16. Peters A. Sparse matrix vector multiplication technique on the IBM 3090 VP. Parallel Computing. 17:1991.
17. E. Rothberg, R. Schreiber, 1994, Improved load balancing in parallel sparse Choleski factorization, Proc. Supercomputing '94, Washington, DC.
18. Y. Saad, K. Wu, S. Petiton, 1993, Sparse matrix computations on the CM-5, Proc. 6th SIAM Conference on Parallel Processing for Scientifical Computing.
19. Yap T. K., Frieder O., Martino R. L. Parallel homologous sequence searching in large databases. Proc. 5th Symposium on the Frontiers of Massively Parallel Computations. February 1995.
20. Paragon OSF/1 User's Manual. 1995.