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.
Type de document :
Article dans une revue
ACM Transactions on Architecture and Code Optimization, Association for Computing Machinery, 2017, 14 (4), pp.1 - 19. 〈10.1145/3162016〉
Liste complète des métadonnées

Littérature citée [35 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01633724
Contributeur : Vincent Loechner <>
Soumis le : mardi 30 janvier 2018 - 14:57:28
Dernière modification le : jeudi 29 mars 2018 - 09:10:05
Document(s) archivé(s) le : lundi 7 mai 2018 - 12:42:26

Identifiants

Collections

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〉

Partager

Métriques

Consultations de la notice

266

Téléchargements de fichiers

156