ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS
From MaRDI portal
Publication:4366895
DOI10.1080/01495739708941417zbMath0886.68042OpenAlexW2040622125MaRDI QIDQ4366895
Publication date: 25 November 1997
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://hal-lara.archives-ouvertes.fr/hal-02101988/file/RR1996-05.pdf
Cites Work
- Unnamed Item
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Dataflow analysis of array and scalar references
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Automatic translation of FORTRAN programs to vector form
- On the Analysis and Synthesis of VLSI Algorithms
- The parallel execution of DO loops
- The Organization of Computations for Uniform Recurrence Equations
This page was built for publication: ON THE OPTIMALITY OF ALLEN AND KENNEDY'S ALGORITHM FOR PARALLELISM EXTRACTION IN NESTED LOOPS