On the optimality of Feautrier's scheduling algorithm

Concurrency and Computation: Practice and Experience

Volumn 15, Issue 11-12, 2003, Pages 1047-1068

  Vivien, Frédéric ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

Automatic parallelization; Parkas' lemma; Scheduling; Vertex method

Indexed keywords

ALGORITHMS; AUTOMATIC PROGRAMMING; HEURISTIC PROGRAMMING; OPTIMIZATION; PROGRAMMING THEORY; SCHEDULING;

AUTOMATIC PARALLELIZATION;

PROGRAM DIAGNOSTICS;

EID: 0141637402     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.780     Document Type: Conference Paper

References (18)

1. Lamport L. The parallel execution of DO loops. Communications of the ACM 1974; 17(2):83-93.
2. Alien JR, Kennedy K. PFC: A program to convert Fortran to parallel form. Technical Report MASC-TR82-6, Rice University, Houston, TX, 1982.
3. Wolf ME, Lam MS, A data locality optimizing algorithm. S1CPLAN Conference PLDI. ACM Press: New York, 1991; 30-44.
4. Feautrier P. Dataflow analysis of array and scalar references. International Journal of Parallel Programming 1991; 20(1):23-51.
5. Feautrier P. Some efficient solutions to the affine scheduling problem, part I: One-dimensional time. International Journal of Parallel Programming 1992; 21(5):313-348.
6. Darte A, Vivien F. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. International Journal of Parallel Programming 1997.
7. Darte A, Robert F, Vivien F. Scheduling and Automatic Parallelization. Birkhäuser: Boston, 2000.
8. Darte A, Diderich C, Gengier M, Vivien F. Scheduling the computations of a loop nest with respect to a given mapping. Proceedings of Euro-Par 2000 (Lecture Notes in Computer Science, vol. 1900), Munich, Germany, September, 2000. Springer; Berlin, 2000; 405-414.
9. Thies W, Vivien F, Sheldon J, Amarasinghe S. A unified framework for schedule and storage optimization. Proceedings of the ACM SICPLAN'Ol Conference on Programming Language Design and Implementation (PLDI), Snowbird, UT, June, 2001. ACM; New York, 2001; 232-242.
10. Feautrier P. Some efficient solutions to the affine scheduling problem, part II; Multi-dimensional time. International Journal of Parallel Programming 1992; 21(6):389-420.
11. Quinton P. The systematic design of systolic arrays. Automata Networks in Computer Science. Manchester University Press: Manchester, U.K., 1987.
12. Schrijver A. Theory of Linear and Integer Programming. Wiley: New York, 1986.
13. Allen J, Callahan D, Kennedy K. Automatic decomposition of scientific programs for parallel execution. Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, Munich, Germany, January 1987. ACM: New York, 1987; 63-76.
14. Griebl M, Feautrier P, Lengauer C. Index set splitting. International Journal of Parallel Programming 2000; 28(6):607-631.
15. Darte A. De l'organisation des calculs dans les codes Répétitifs. Habilitation thesis, École normale supérieure de Lyon, 1999.
16. Loechner V, Wilde DK. Parameterized polyhedra and their vertices. International Journal of Parallel Programming 1997; 25(6).
17. Polylib-a library of polyhedral functions, http://icps.u-strasbg.fr/polylib/ or http://www.kisa.fr/polylib/.
18. Clauss P. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. Proceedings of the International Conference on Supercomputing, Philadelphia, PA, 1996. ACM: New York, 1996; 278-285.