论文信息 - Performance Evaluation of Parallel Sparse Matrix-Vector Products on SGI Altix3700

Performance Evaluation of Parallel Sparse Matrix-Vector Products on SGI Altix3700

The present paper discusses scalable implementations of sparse matrix-vector products, which are crucial for high performance solutions of large-scale linear equations, on a cc-NUMA machine SGI Altix3700. Three storage formats for sparse matrices are evaluated, and scalability is attained by implementations considering the page allocation mechanism of the NUMA machine. Influences of the cache/memory bus architectures on the optimum choice of the storage format are examined, and scalable converters between storage formats shown to facilitate exploitation of storage formats of higher performance.

[1] Y. Saad,et al. Krylov Subspace Methods on Supercomputers , 1989 .

[2] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.

[3] John N. Shadid,et al. Official Aztec user''s guide: version 2.1 , 1999 .

[4] John G. Lewis,et al. Sparse matrix test problems , 1982, SGNM.

[5] P. Sadayappan,et al. On improving the performance of sparse matrix-vector multiplication , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[6] Eun Im,et al. Optimizing the Performance of Sparse Matrix-Vector Multiplication , 2000 .

[7] V. Eijkhout,et al. Reverse Communication Interface for Linear Algebra Templates for Iterative Methods , 1995 .

[8] Sivan Toledo,et al. Improving the memory-system performance of sparse-matrix vector multiplication , 1997, IBM J. Res. Dev..

[9] Victor Eijkhout,et al. Self-Adapting Linear Algebra Algorithms and Software , 2005, Proceedings of the IEEE.