Finding Free Schedules for Non-uniform Loops [chapter]

Volodymyr Beletskyy, Krzysztof Siedlecki
2003 Lecture Notes in Computer Science  
Algorithms, permitting us to build free schedules for perfectly and imperfectly nested affine loops with non-uniform dependences, are presented. The operations of each time schedule can be executed as soon as their operands are available. This allows us to extract maximum loop parallelism. The algorithms require exact dependence analysis. To describe and implement the algorithm and carry out experiences, the dependence analysis by Pugh and Wonnacott has been chosen where dependences are found
more » ... the form of tuple relations. The algorithms can be applied for both non-parametrized and parametrized loops. The algorithms proposed has been implemented and verified by means of the Omega project software.
doi:10.1007/978-3-540-45209-6_44 fatcat:g6f7gmn6prhg7crlnlmkkgcij4