Sparse triangular solves for ILU revisited: data layout crucial to better performance.; .
- Mathematics and Computer Science
A key to good processor utilization for sparse matrix computations is storing the data in the format that is most conducive to fast access by the memory system. In particular, for sparse matrix triangular solves the traditional compressed sparse matrix format is poor, and minor adjustments to the data structure can increase the processor utilization dramatically. Such adjustments involve storing the L and U factors separately and storing the U rows 'backwards' so that they are accessed in a simple streaming fashion during the triangular solves. Changes to the PETSc libraries to use this modified storage format resulted in over twice the floating-point rate for some matrices. This improvement can be accounted for by a decrease in the cache misses and TLB (transaction lookaside buffer) misses in the modified code.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC)
- DOE Contract Number:
- DE-AC02-06CH11357
- OSTI ID:
- 1035754
- Report Number(s):
- ANL/MCS/JA-64868; TRN: US201205%%369
- Journal Information:
- International Journal of High Performance Computing Applications, Vol. 25, Issue 4; ISSN 1740-0562
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Highly scalable distributed-memory sparse triangular solution algorithms.
Parallel sparse matrix computations: Wavefront minimization of sparse matrices. Final report for the period ending June 14, 1998