Skip to Main content Skip to Navigation
Conference papers

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 - ENS 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Albert Cohen Connect in order to contact the contributor
Submitted on : Sunday, December 1, 2013 - 1:44:16 AM
Last modification on : Thursday, March 17, 2022 - 10:08:43 AM


  • HAL Id : hal-00911894, version 1



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



Record views