Please use this identifier to cite or link to this item:
https://hdl.handle.net/20.500.11779/1987| Title: | A Novel Graph Transformation Strategy for Optimizing Sptrsv on Cpus |
| Authors: | Yılmaz, Buse |
| Keywords: | Iccg Graph transformation Sptrsv Parallel computing Sparse matrix Sparse triangle solve |
| Publisher: | Wiley |
| Source: | Yılmaz, B. A novel graph transformation strategy for optimizing SpTRSV on CPUs. Concurrency and Computation: Practice and Experience, e7761. |
| Abstract: | 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 $$. |
| URI: | https://hdl.handle.net/20.500.11779/1987 https://doi.org/10.1002/cpe.7761 |
| ISSN: | 1532-0626 1532-0634 |
| Appears in Collections: | Bilgisayar Mühendisliği Bölümü Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Concurrency and Computation - 2023 - Y lmaz - A novel graph transformation strategy for optimizing SpTRSV on CPUs.pdf Until 2040-01-01 | Full Text- Article | 3.28 MB | Adobe PDF | View/Open |
CORE Recommender
Sorry the service is unavailable at the moment. Please try again later.
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.