Revisiting Loop Transformations with X10 Clocks

Tomofumi Yuki 1, 2
2 COMPSYS - Compilation and embedded computing systems
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Loop transformations are known to be important for performance of compute-intensive programs, and are often used to expose parallelism. However, many transformations involving loops often obfuscate the code, and are cumbersome to apply by hand. The goal of this paper is to explore alternative methods for expressing parallelism that are more friendly to the programmer. In particular, we seek to expose parallelism without significantly changing the original loop structure. We illustrate how clocks in X10 can be used to express some of the traditional loop transformations, in the presence of parallelism, in a manner that we believe to be less invasive. Specifically, expressing parallelism corresponding to one-dimensional affine schedules can be achieved without modifying the original loop structure and/or statements.
Type de document :
Communication dans un congrès
Proceedings of the ACM SIGPLAN Workshop on X10, Jun 2015, Portland, OR, United States. 2015, 〈http://x10-lang.org/articles/268.html〉. 〈10.1145/2771774.2771778〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01253630
Contributeur : Tomofumi Yuki <>
Soumis le : lundi 11 janvier 2016 - 10:32:26
Dernière modification le : vendredi 20 avril 2018 - 15:44:25

Identifiants

Collections

Citation

Tomofumi Yuki. Revisiting Loop Transformations with X10 Clocks. Proceedings of the ACM SIGPLAN Workshop on X10, Jun 2015, Portland, OR, United States. 2015, 〈http://x10-lang.org/articles/268.html〉. 〈10.1145/2771774.2771778〉. 〈hal-01253630〉

Partager

Métriques

Consultations de la notice

111