Maximizing parallelism and minimizing synchronization with affine partitions

Parallel Computing

Volumn 24, Issue 3-4, 1998, Pages 445-475

  Lim, Amy W ^a   Lam, Monica S ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Affine partitions; Affine transforms; Coarse granularity; Multiprocessors; Parallelism; Parallelizing compilers; Synchronization

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS PROGRAMMING; DATA ACQUISITION; PROGRAM COMPILERS;

DATA DEPENDENCE ABSTRACTIONS; DATA DEPENDENCE VECTORS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032067773     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(98)00021-0     Document Type: Article

References (26)

1. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
2. D. Bacon, S. Graham, O. Sharp, Compiler transformations for high-performance computing, Computing Surveys 26 (4) (1994) 345-420.
3. J.R. Allen, D. Callahan, K. Kennedy, Automatic decomposition of scientific programs for parallel execution, in: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987, pp. 63-76.
4. U. Banerjee, Loop Transformations for Restructuring Compilers, Kluwer Academic, 1993.
5. K. Kennedy, K.S. McKinley, Optimizing for parallelism and data locality, in: Proceedings of the 1992 ACM International Conference on Supercomputing, 1992, pp. 323-334.
6. D.J. Kuck, R.H. Kühn, D. Padua, B. Leasure, M. Wolfe, Dependence graphs and compiler optimizations, in: Conference Record of the Eighth ACM Symposium on Principles of Programming Languages, 1981, pp. 207-218.
7. D. Padua, M. Wolfe, Advanced compiler optimizations for supercomputers, Commun. ACM 29 (1986) 1184-1201.
8. M.J. Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge, MA, 1989.
9. K.S. McKinley, Evaluating automatic parallelization for efficient execution on shared-memory multiprocessors, in: Proceedings of the 1994 ACM International Conference on Supercomputing, 1994.
10. K. Smith, B. Appelbe, Determining transformation sequences for loop parallelization, in: Proceedings of the Fifth Workshop on Programming Languages and Compilers for Parallel Computing, 1992.
11. D. Whitfield, M.L. Soffa, Investigating properties of code transformations, in: Proceedings of the 1993 International Conference on Parallel Processing, ACM, 1993.
12. D.I. Moldovan, On the analysis and synthesis of vlsi algorithms, Trans. Comput. 31 (1982) 1121-1125.
13. P. Quinton, Automatic synthesis of systolic arrays from uniform recurrent equations, in: Proceedings of the Eleventh Symposium on Computer Architecture, 1984.
14. U. Banerjee, Unimodular transformations of double loops, in: Proceedings of the Third Workshop on Programming Languages and Compilers for Parallel Computing, 1990, pp. 192-219.
15. M.E. Wolf, M.S. Lam, A loop transformation theory and an algorithm to maximize parallelism, Trans. Parallel Distributed Systems 2 (1991) 452-470.
16. A. Darte, Y. Robert, Affine-by-statement scheduling of uniform loop nests over parametric domains. Technical Report 92-16, Laboratoire de l'Informatique du Parallélisme, 1992.
17. P. Feautrier. Some efficient solutions to the affine scheduling problem, part i, one-dimensional time. Technical Report 92.28, Institut Blaise Pascal/Laboratoire MASI, 1992.
18. P. Feautrier, Some efficient solutions to the affine scheduling problem: Part II. Multi-Dimensional Time, Technical Report 92.78, Institut Blaise Pascal/Laboratoire MASI, 1992.
19. P. Feautrier, Some efficient solutions to the affine scheduling problem: Part I. One-dimensional time, Int. J. Parallel Programming 21 (5) (1992) 313-348.
20. P. Feautrier, Some efficient solutions to the affine scheduling problem: Part II. Multidimensional time, Int. J. Parallel Programming 21 (6) (1992) .
21. P. Feautrier, Towards automatic distribution, Technical Report 92.95, Institut Blaise Pascal/Laboratoire MASI, December 1992.
22. A. Darte, G. Silber, F. Vivien, Combining retiming and scheduling techniques for loop parallelization and loop tiling. Technical Report 96-34, Laboratoire de l'Informatique du Parallélisme, 1996.
23. W. Kelly, W. Pugh, Minimizing communication while preserving parallelism, in: Proceedings of the 1996 ACM International Conference on Supercomputing, 1996, pp. 52-60.
24. C. Ancourt, F. Irigoin, Scanning polyhedra with DO loops, in: Proceedings of the Third ACM/SIGPLAN Symposium on Principles and Practice of Parallel Programming, 1991, pp. 39-50.
25. A.W. Lim, M.S. Lam, Communication-free parallelization via affine transformations, in: Proceedings of the Seventh Workshop on Programming Languages and Compilers for Parallel Computing, Springer, 1994, pp. 92-106.
26. A.W. Lim, M.S. Lam, Maximizing parallelism and minimizing synchronization with affine transforms, in: Conference Record of the 24th Annual ACM Symposium on Principles of Programming Languages, 1997.