Podrobná bibliografie
| Název: |
A novel graph transformation strategy for optimizing SpTRSV on CPUs. |
| Autoři: |
Yılmaz, Buse |
| Zdroj: |
Concurrency & Computation: Practice & Experience; Nov2023, Vol. 35 Issue 24, p1-18, 18p |
| Témata: |
SPARSE matrices, SPARSE graphs, PARALLEL programming |
| Abstrakt: |
Summary: Sparse triangular solve (SpTRSV) is an extensively studied computational kernel. An important obstacle in parallel SpTRSV implementations is that in some parts of a sparse matrix the computation is serial. By transforming the dependency graph, it is possible to increase the parallelism of the parts that lack it. In this work, we present a novel graph transformation strategy to increase the parallelism degree of a sparse matrix and compare it to our previous strategy. It is seen that our transformation strategy can provide a speedup as high as 1.42x$$ 1.42x $$. [ABSTRACT FROM AUTHOR] |
|
Copyright of Concurrency & Computation: Practice & Experience is the property of Wiley-Blackwell 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 |
Full Text Finder 
Nájsť tento článok vo Web of Science