Schedule Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Schedule Trees


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.
No file

Dates and versions

hal-00911894 , version 1 (01-12-2013)


  • 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⟩
393 View
0 Download


Gmail Facebook X LinkedIn More