Abstract
We present a method to isolate a loop-body for all iterations in a particular polyhedral set. This isolation is done by successively partitioning execution sets of individual DO-loops in the loop, thereby partitioning the iteration space according to the linear inequalities that define the polyhedral set. This method can be used to simplify programs or to support data structure transformations.
Cite
CITATION STYLE
Bik, A. J. C., & Wijshoff, H. A. G. (1996). Iteration space partitioning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1067, pp. 475–484). Springer Verlag. https://doi.org/10.1007/3-540-61142-8_586
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
