A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is
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 founddoi:10.1007/978-3-540-45209-6_44 fatcat:g6f7gmn6prhg7crlnlmkkgcij4