The Impact of Hardware Gather/Scatter on Sparse Gaussian Elimination
Authors:
- 1 March 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 9 (2) , 304-311
Abstract
Recent vector supercomputers provide vector memory access to “randomly” indexed vectors, whereas early vector supercomputers required contiguously or regularly indexed vectors. This additional capability, known as “hardware gather/scatter,” can be used to great effect in general sparse Gaussian elimination. In this note we present some examples that show the impact of this change in hardware on the choice of algorithms for sparse Gaussian elimination. Common folk wisdom holds that general sparse Gaussian elimination algorithms do not perform well on vector computers. Our numerical results demonstrate that hardware gather/scatter allows general sparse elimination algorithms to outperform algorithms based on a band, envelope, or block structure on such computers.Keywords
This publication has 5 references indexed in Scilit:
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- Proposed sparse extensions to the Basic Linear Algebra SubprogramsACM SIGNUM Newsletter, 1985
- Benchmarking a Sparse Elimination Routine on the Cyber 205 and the Cray 1-SSociety of Petroleum Engineers Journal, 1983
- Sparse matrix test problemsACM SIGNUM Newsletter, 1982
- Basic Linear Algebra Subprograms for Fortran UsageACM Transactions on Mathematical Software, 1979