Bibliographic Details
| Title: |
Algebraic Block Multi-Color Ordering Method for Parallel Multi-Threaded Sparse Triangular Solver in ICCG Method. |
| Authors: |
Iwashita, Takeshi, Nakashima, Hiroshi, Takahashi, Yasuhito |
| Source: |
2012 IEEE 26th International Parallel & Distributed Processing Symposium; 1/ 1/2012, p474-483, 10p |
| Abstract: |
This paper covers the multi-threaded parallel processing of a sparse triangular solver for a linear system with a sparse coefficient matrix, focusing on its application to a parallel ICCG solver. We propose algebraic block multi-color ordering, which is an enhanced version of block multi-color ordering for general unstructured analysis. We present blocking and coloring strategies that achieve a high cache hit ratio and fast convergence. Five numerical tests on a shared memory parallel computer verify that the computation time of the proposed method is between 1.7 and 2.6 times faster than that of the conventional multi-color ordering method. [ABSTRACT FROM PUBLISHER] |
|
Copyright of 2012 IEEE 26th International Parallel & Distributed Processing Symposium is the property of IEEE 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.) |
| Database: |
Complementary Index |
Full Text Finder