On the Optimality of Feautrier's Scheduling Algorithm

Feautrier's scheduling algorithm is the most powerful existing algorithm for parallelism detection and extraction. But it has always been known to be suboptimal. However, the question whether it may miss some parallelism because of its design was still open. We show that this is not the case. Therefore, to find more parallelism than this algorithm does, one needs to get rid of some of the hypotheses underlying its framework.

[1]  Frédéric Vivien.  On the optimality of Feautrier's scheduling algorithm , 2003, Concurr. Comput. Pract. Exp..

[2]  Monica S. Lam,et al.  A data locality optimizing algorithm , 1991, PLDI '91.

[3]  TimePaul FeautrierLaboratoire Masi.  Some Eecient Solutions to the Aane Scheduling Problem Part I One-dimensional Time , 1993 .

[4]  Patrice Quinton,et al.  The systematic design of systolic arrays , 1987 .

[5]  David K. Smith.  Theory of Linear and Integer Programming , 1987 .

[6]  Martin Griebl,et al.  Index Set Splitting , 2000, International Journal of Parallel Programming.

[7]  Vincent Loechner,et al.  Parameterized Polyhedra and Their Vertices , 1997, International Journal of Parallel Programming.

[8]  Frédéric Vivien,et al.  A unified framework for schedule and storage optimization , 2001, PLDI '01.

[9]  Yves Robert,et al.  Scheduling and Automatic Parallelization , 2000, Birkhäuser Boston.

[10]  Frédéric Vivien,et al.  Optimal Fine and Medium Grain Parallelism Detection in Polyhedral Reduced Dependence Graphs , 2004, International Journal of Parallel Programming.

[11]  Ken Kennedy,et al.  PFC: A Program to Convert Fortran to Parallel Form , 1982 .

[12]  Philippe Clauss,et al.  Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs , 1996 .

[13]  Ken Kennedy,et al.  Automatic decomposition of scientific programs for parallel execution , 1987, POPL '87.

[14]  Leslie Lamport,et al.  The parallel execution of DO loops , 1974, CACM.

[15]  Frédéric Vivien,et al.  Scheduling the Computations of a Loop Nest with Respect to a Given Mapping , 2000, Euro-Par.