Abstract
An algorithm, permitting us to build free schedules for arbitrary nested non-uniform loops, is presented. The operations of each time schedule can be executed as soon as their operands are available. The algorithm requires exact dependence analysis. To describe and implement the algorithm and to carry out experiences, the dependence analysis by Pugh and Wonnacott was chosen where dependences are found in the form of tuple relations. The algorithm can be applied for both non-parameterized and parameterized loops. The algorithm proposed has been implemented and verified by means of the Omega project software. © Springer-Verlag 2003.
Cite
CITATION STYLE
Beletskyy, V., & Siedlecki, K. (2004). Finding free schedules for non-uniform loops. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 297–302. https://doi.org/10.1007/978-3-540-45209-6_44
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
