Title: Integer set coalescing
Authors: Verdoolaege, Sven # ×
Issue Date: 19-Jan-2015
Conference: International Workshop on Polyhedral Compilation Techniques edition:5 location:Amsterdam, The Netherlands date:19 January 2015
Abstract: In polyhedral compilation, various core concepts such as the set
of statement instances, the access relations, the dependences and
the schedule are represented or approximated using sets and binary
relations of sequences of integers bounded by (quasi-)affine constraints.
When these sets and relations are represented in disjunctive normal form,
it is important to keep the number of disjuncts small, both for efficiency
and to improve the computation of transitive closure overapproximations
and AST generation. This paper describes the set coalescing operation
of isl that looks for opportunities to combine several disjuncts into
a single disjunct without affecting the elements in the set. The main
purpose of the paper is to explain the various heuristics and to prove
their correctness.
Publication status: published
KU Leuven publication type: IMa
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
impact2015-verdoolaege-coalescing.pdfpaper Published 267KbAdobe PDFView/Open
impact2015-verdoolaege-coalescing-slides.pdfPresentation Published 509KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.