Scalable and structured scheduling

International Journal of Parallel Programming

Volumn 34, Issue 5, 2006, Pages 459-487

  Feautrier, Paul ^a  

^a UNIVERSITÉ LYON 1   (France)

Author keywords

Automatic parallelization; Scalability; Structured scheduling

Indexed keywords

GRAPH THEORY; LINEAR PROGRAMMING; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

AUTOMATIC PARALLELIZATION; SCALABILITY; STRUCTURED SCHEDULING; SYNCHRONOUS PROGRAM;

SCHEDULING;

EID: 33750334716     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10766-006-0011-4     Document Type: Article

References (18)

1. C. Ancourt and F. Irigoin, Scanning polyhedra with DO Loops, in Proceedings of the third SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 39-50. ACM Press, April 1991.
2. C. Bastoul, Efficient Code Generation for Automatic Parallelization and Optimization, in ISPDC'03 IEEE International Symposium on Parallel and Distributed Computing, pp. 23-30. Ljublana, October 2003.
3. A. J. Bernstein, Analysis of Programs for Parallel Processing, IEEE Transactions on El. Computers, EC-15, 1966.
4. P. Boulet and P. Feautrier, Scanning Polyhedra without DO Loops, in PACT'98, October 1998.
5. A. Darte, R. Schreiber and G. Villard, Lattice-based Memory Allocation, in sixth ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES 2003), October 2003.
6. P. Feautrier, Semantical Analysis and Mathematical Programming: Application to Parallelization and Vectorization, in M. Cosnard, Y. Robert, P. Quinton, and M. Raynal, eds., Workshop on Parallel and Distributed Algorithms, Bonas, pp. 309-320. North Holland, 1989.
7. P. Feautrier, Dataflow Analysis of Scalar and Array References, International Journal of Parallel Programming, 20(1):23-53, February 1991.
8. P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, I, One-dimensional Time, International Journal of Parallel Programming, 21(5):313-348, October 1992.
9. P. Feautrier, Some Efficient Solutions to the Affine Scheduling Problem, II, Multidimensional Time, International Journal of Parallel Programming, 21(6):389-420, December 1992.
10. M. Griebl, P. Feautrier and C. Lengauer, Index Set Splitting, International Journal of Parallel Programming, 28(6):607-631, 2000.
11. G. Kahn, The Semantics of a Simple Language for Parallel Programming, in IFIP'94, pp. 471-475. North Holland 1974.
12. H. Leverge, C. Mauras and P. Quinton. The ALPHA Language and its Use for the Design of Systolic Arrays, Journal of VLSI Signal Processing, 3:173-182, 1991.
13. P. Quinton and T. Risset, Structured Scheduling of Recurrence Equations: Theory and Practice, in Proceedings of the System Architecture Modelling and Simulation Workshop, Lecture Notes in Computer Science, 2268, Samos, Greece, 2001. Springer Verlag.
14. P. Quinton, The Systematic Design of Systolic Arrays, in F. Fogelman, Y. Robert and M. Tschuente, eds., Automata Networks in Computer Science, pp. 229-260. Manchester University Press, December 1987.
15. A. Schrijver, Theory of Linear and Integer Programming, Wiley, NewYork, 1986.
16. Robert E. Tarjan, Graph Theory and Gaussian Elimination, in J. Bunch and D. Rose, eds., Sparse Matrix Computations. Academic Press, 1976.
17. W. Thies, F. Vivien, J. Sheldon and S. Amarasinghe, A unified framework for schedule and storage optimization, in ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, June 2001.
18. R. Triolet, F. Irigoin and P. Feautrier, Automatic Parallelization of FORTRAN Programs in the Presence of Procedure Calls, in B. Robinet and R. Wilhelm, eds., ESOP 1986, LNCS 213. Springer-Verlag, 1986.