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

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.
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal.inria.fr/hal-01633724
Contributor : Vincent Loechner <>
Submitted on : Tuesday, January 30, 2018 - 2:57:28 PM
Last modification on : Tuesday, April 2, 2019 - 1:39:10 AM
Long-term archiving on : Monday, May 7, 2018 - 12:42:26 PM

Identifiers

Citation

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

Share

Metrics

Record views

351

Files downloads

925