An asymptotically optimal affine schedule on bounded convex polyhedric domains
Author:
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 500-514
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Constructive methods for scheduling uniform loop nestsIEEE Transactions on Parallel and Distributed Systems, 1994
- Some efficient solutions to the affine scheduling problem. Part II. Multidimensional timeInternational Journal of Parallel Programming, 1992
- Some efficient solutions to the affine scheduling problem. I. One-dimensional timeInternational Journal of Parallel Programming, 1992
- LINEAR SCHEDULING IS NEARLY OPTIMALParallel Processing Letters, 1991
- The Organization of Computations for Uniform Recurrence EquationsJournal of the ACM, 1967