On loop transformations of nested loops with affine dependencies
From MaRDI portal
Publication:5950531
DOI10.1016/S0010-4655(01)00232-6zbMath0985.68013OpenAlexW2052992886MaRDI QIDQ5950531
Karl-Heinz Zimmermann, Andreas Popp
Publication date: 18 December 2001
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0010-4655(01)00232-6
Theory of compilers and interpreters (68N20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- Partitioning processor arrays under resource constraints
- A unifying lattice-based approach for the partitioning of systolic arrays via LPGS and LSGP
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization
- The quickhull algorithm for convex hulls
- The parallel execution of DO loops
- The Organization of Computations for Uniform Recurrence Equations