Schedule Trees

Sven Verdoolaege 1 Serge Guelton 1 Tobias Grosser 1 Albert Cohen 1
1 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : Schedules in the polyhedral model, both those that represent the original execution order and those produced by scheduling algorithms, naturally have the form of a tree. Generic schedule representations proposed in the literature encode this tree structure such that it is only implicitly available. Following the internal representation of isl, we propose to represent schedules as explicit trees and further extend the concept by introducing different kinds of nodes. We compare our schedule trees to other representations in detail and illustrate how they have been successfully used to simplify the implementation of a non-trivial polyhedral compiler.
Type de document :
Communication dans un congrès
IMPACT - 4th Workshop on Polyhedral Compilation Techniques, associated with HiPEAC, Jan 2014, Vienna, Austria. ACM, 2014
Liste complète des métadonnées

https://hal.inria.fr/hal-00911894
Contributeur : Albert Cohen <>
Soumis le : dimanche 1 décembre 2013 - 01:44:16
Dernière modification le : jeudi 29 septembre 2016 - 01:22:04

Identifiants

  • HAL Id : hal-00911894, version 1

Collections

Citation

Sven Verdoolaege, Serge Guelton, Tobias Grosser, Albert Cohen. Schedule Trees. IMPACT - 4th Workshop on Polyhedral Compilation Techniques, associated with HiPEAC, Jan 2014, Vienna, Austria. ACM, 2014. 〈hal-00911894〉

Partager

Métriques

Consultations de la notice

241