PSSOLVE: A CONCURRENT ALGORITHM FOR SOLVING SPARSE SYSTEMS OF LINEAR EQUATIONS.
- Additional Document Info
- View All
PSolve solves a sparse system of linear equations on a shared-memory parallel processor. Each autonomous process reduces a pair of matrix rows, uses pairwise pivoting for numerical stability, and synchronizes with only a few others at a time. For most test matrices on the Alliant FX/8 multiprocessor, PSolve is faster than Gaussian Elimination (which does not exploit sparsity) and the Yale Sparse Matrix Package (which does not exploit parallelism). PSolve cannot use currently available vector hardware because of its compact matrix storage scheme. However, with a novel sparse-align vector unit, PSolve is vectorizable and runs faster than any other algorithm for all the selected test matrices.
Proceedings of the International Conference on Parallel Processing
author list (cited authors)
Davis, T. A., & Davidson, E. S.
complete list of authors