arXiv Open Access 2022

A Graph Transformation Strategy for Optimizing SpTRSV

Buse Yılmaz Abdülkadir Furkan Yıldız

Lihat Sumber

Abstrak

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 an approach to increase the parallelism degree of a sparse matrix, discuss its limitations and possible improvements, and we compare it to a previous manual approach. The results provide several hints on how to craft a collection of strategies to transform a dependency graph.

Topik & Kata Kunci

cs.DC

Penulis (2)

Buse Yılmaz

Abdülkadir Furkan Yıldız

Format Sitasi

APA MLA BibTeX

Yılmaz, B., Yıldız, A.F. (2022). A Graph Transformation Strategy for Optimizing SpTRSV. https://arxiv.org/abs/2206.05843

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2022
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓