Schedule Trees

Sven Verdoolaege, Serge Guelton, Tobias Grosser, Albert Cohen

Research output: Contribution to conferencePaperpeer-review

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.
Original languageEnglish
Number of pages9
Publication statusPublished - 20 Jan 2014
Event4th International Workshop on Polyhedral Compilation Techniques - Vienna, Austria
Duration: 20 Jan 201420 Jan 2014
http://impact.gforge.inria.fr/impact2014/

Workshop

Workshop4th International Workshop on Polyhedral Compilation Techniques
Abbreviated titleIMPACT 2014
CountryAustria
CityVienna
Period20/01/1420/01/14
Internet address

Fingerprint Dive into the research topics of 'Schedule Trees'. Together they form a unique fingerprint.

Cite this