Podrobná bibliografie
| Název: |
Sparse triangular solves for ILU revisited: data layout crucial to better performance. |
| Autoři: |
Smith, Barry, Zhang, Hong |
| Zdroj: |
International Journal of High Performance Computing Applications; Nov2011, Vol. 25 Issue 4, p386-391, 6p |
| Témata: |
MACRO processors, DATA, COMPUTER storage devices, BUFFER storage (Computer science), CYBERNETICS |
| Abstrakt: |
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. [ABSTRACT FROM PUBLISHER] |
|
Copyright of International Journal of High Performance Computing Applications is the property of Sage Publications Inc. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Databáze: |
Complementary Index |
Nájsť tento článok vo Web of Science