Performance Evaluation of a Parallel Iterative Method Library using OpenMP

Authors:
Hisashi Kotakemori;Hidehiko Hasegawa
Affiliations:
JST CREST and University of Toky;University of Tsukuba and JST CREST
Venue:
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
Year:
2005

Citing 4
Cited 2

Improving the memory-system performance of sparse-matrix vector multiplication

IBM Journal of Research and Development
Improving performance of sparse matrix-vector multiplication

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
Refining an approximate inverse

Journal of Computational and Applied Mathematics - Special issue on numerical analysis 2000 Vol. III: linear algebra
Optimizing the performance of sparse matrix-vector multiplication

Optimizing the performance of sparse matrix-vector multiplication

MAPS: multi-algorithm parallel circuit simulation

Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Experience in developing an open source scalable software infrastructure in japan

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The present paper discusses scalable implementations of sparse matrix-vector products using OpenMP to execute the iterative method on the SGI Altix3700, the IBM eServer p5 595 and the Sun SunFire15K. Three storage formats (CRS, BSR and DIA) for sparse matrices are evaluated. The present implementation provides satisfactory scalabilities. In some cases, an optimal storage format with data conversion should be used. In addition, the influence of the cache/memory bus architectures on the optimum choice of the storage format is examined.