On the optimality of feautrier’s scheduling algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2400, Issue , 2002, Pages 299-309

  Vivien, Frédéric ^a  

^a UNIVERSITÉ DE STRASBOURG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

OPTIMALITY;

SCHEDULING ALGORITHMS;

EID: 84956855958     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45706-2_39     Document Type: Conference Paper

References (15)

1. J. Allen, D. Callahan, and K. Kennedy. Automatic decomposition of scientific programs for parallel execution. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 63–76, Munich, Germany, Jan. 1987.
2. J. R. Allen and K. Kennedy. PFC: A program to convert Fortran to parallel form. Technical Report MASC-TR82-6, Rice University, Houston, TX, USA, 1982.
3. A. Darte. De l’organisation des calculs dans les codes répétitifs. Habilitation thesis, ècole normale supérieure de Lyon, 1999.
4. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhäuser Boston, 2000. ISBN 0-8176-4149-1.
5. A. Darte and F. Vivien. Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs. Int. J. of Parallel Programming, 1997.
6. P. Feautrier. Dataflow analysis of array and scalar references. International Journal of Parallel Programming, 20(1):23–51, 1991.
7. P. Feautrier. Some efficient solutions to the affine scheduling problem, part I: One-dimensional time. Int. J. Parallel Programming, 21(5):313–348, Oct. 1992.
8. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II: Multi-dimensional time. Int. J. Parallel Programming, 21(6):389–420, Dec. 1992.
9. M. Griebl, P. Feautrier, and C. Lengauer. Index set splitting. International Journal of Parallel Programming, 28(6):607–631, 2000.
10. L. Lamport. The parallel execution of DO loops. Communications of the ACM, 17(2):83–93, Feb. 1974.
11. V. Loechner and D. K. Wilde. Parameterized polyhedra and their vertices. International Journal of Parallel Programming, 25(6), Dec. 1997.
12. P. Quinton. Automata Networks in Computer Science, chapter The systematic design of systolic arrays. Manchester University Press, 1987.
13. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, New York, 1986.
14. F. Vivien. On the Optimality of Feautrier’s Scheduling Algorithm. Technical Report 02-04, ICPS-LSIIT, ULP-Strasbourg I, France, http://icps.u-strasbg.fr, 2002.
15. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In SIGPLAN Conference PLDI, pages 30–44. ACM Press, 1991.