Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Architecture and Code Optimization Year : 2017

Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts

(1) , (2) , (3, 4)
1
2
3
4

Abstract

Over the past few years, multicore systems have become more and more powerful and, thereby, very useful in high-performance computing. However, many applications, such as some linear algebra algorithms, still cannot take full advantage of these systems. This is mainly due to the shortage of optimization techniques dealing with irregular control structures. In particular, the well-known polyhedral model fails to optimize loop nests whose bounds and/or array references are not affine functions. This is more likely to occur when handling sparse matrices in their packed formats. In this paper, we propose to use 2d-packed layouts and simple affine transformations to enable optimization of triangular and banded matrix operations. The benefit of our proposal is shown through an experimental study over a set of linear algebra benchmarks.
Fichier principal
Vignette du fichier
BSL17-2dpacked.pdf (1.32 Mo) Télécharger le fichier
Loading...

Dates and versions

hal-01633724 , version 1 (30-01-2018)

Identifiers

Cite

Toufik Baroudi, Rachid Seghir, Vincent Loechner. Optimization of Triangular and Banded Matrix Operations Using 2d-Packed Layouts. ACM Transactions on Architecture and Code Optimization, 2017, 14 (4), pp.1 - 19. ⟨10.1145/3162016⟩. ⟨hal-01633724⟩
273 View
1370 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More