A Loop Transformation Theory and an Algorithm to Maximize Parallelism

IEEE Transactions on Parallel and Distributed Systems

Volumn 2, Issue 4, 1991, Pages 452-471

  Wolf, Michael E ^a   Lam, Monica S ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; DIGITAL STORAGE; PROGRAM COMPILERS;

LOOP TRANSFORMATIONS; PARALLEL COMPILATION; PARALLEL PROCESSORS;

PARALLEL PROCESSING SYSTEMS;

EID: 0026232450     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.97902     Document Type: Article

References (26)

1. R. Allen and K. Kennedy, “Automatic translation of FORTRAN programs to vector form,” ACM Trans. Programming Languages Syst., vol. 9, no. 4, pp. 491–542, 1987.
2. U. Banerjee, “Data dependence in ordinary programs,” Tech. Rep. 76–837, Univ. of Illinois Urbana-Champaign, Nov. 1976.
3. U. Banerjee, Dependence Analysis for Supercomputing. Boston, MA: Kluwer Academic, 1988.
4. U. Banerjee, “A theory of loop permutations,” in Proc. 2nd Workshop Languages Compilers Parallel Computing, 1989.
5. U. Banerjee, “Unimodular transformations of double loops,” in Proc. 3rd Workshop Languages Compilers Parallel Computing, Aug. 1989.
6. R. Cytron, “Compile-time scheduling and optimization for asynchronous machines,” Ph.D. dissertation, Univ. of Illinois at Urbana-Champaign, 1984.
7. J.-M. Delosme and I. C. F. Ipsen, “Efficient systolic arrays for the solution of Toeplitz systems: An illustration of a methodology for the construction of systolic architectures in VLSI,” Tech. Rep. 370, Yale Univ. 1985.
8. J. A. B. Fortes and D. I. Moldovan, “Parallelism detections and transformation techniques useful for VLSI algorithms,” J. Parallel Distributed Comput., vol. 2, pp. 277–301, 1985.
9. K. Gallivan, W. Jalby, U. Meier, and A. Sameh, “The impact of hierarchical memory systems on linear algebra algorithm design,” Tech. Rep., Univ. of Illinois, 1987.
10. D. Gannon, W. Jalby, and K. Gallivan, “Strategies for cache and local memory management by global program transformation,” J. Parallel and Distributed Comput., vol. 5, pp. 587–616, 1988.
11. F. Irigoin, “Partitionnement des boucles imbeiquees: Une technique d'optimisation pour les programmes scientifiques,” Ph.D. dissertation, Universite Paris-VI, June 1987.
12. F. Irigoin and R. Triolet, “Computing dependence direction vectors and dependence cones,” Tech. Rep. E94, Centre D'Automatique et Informatique, 1988.
13. F. Irigoin R. Triolet, “Supernode partitioning,” in Proc. 15th Annu. ACM SIGACT-SIGPLAN Symp. Principles Programming Languages, Jan. 1988, pp. 319–329.
14. F. Irigoin R. Triolet, “Dependence approximation and global parallel code generation for nested loops,” in Parallel Distributed Algorithms, 1989.
15. M. S. Lam, “Software pipelining: An effective scheduling technique for VLIW machines,” in Proc. ACM SIGPLAN ’88 Conf. Programming Language Design Implementation, June 1988, pp. 318–328.
16. D. E. Maydan, J. L. Hennessy, and M. S. Lam, “Efficient and exact data dependence analysis,” in Proc. ACM SIGPLAN '91 Conf. Programming Language Design Implementation, June 1991, pp. 1–14
17. A. Porterfield, “Software methods for improvement of cache performance on supercomputer applications,” Ph.D. dissertation, Rice Univ., 1989.
18. P. Quinton, “The systematic design of systolic arrays,” Tech. Rep. 193, Centre National de la Recherche Scientifique, 1983.
19. P. Quinton, “Automatic synthesis of systolic arrays from uniform recurrent equations,” in Proc. 11th Annu. Int. Symp. Comput. Architecture, June 1984.
20. H. B. Ribas, “Automatic generation of systolic programs from nested loops,” Ph.D. dissertation, Carnegie Mellon Univ., June 1990.
21. R. Schreiber and J. Dongarra, “Automatic blocking of nested loops,” 1990.
22. C.-W. Tseng and M.J. Wolfe, “The power test for data dependence,” Tech. Rep., Rice COMP TR90-145, Rice Univ., Dec. 1990.
23. M. E. Wolf, “Improving parallelism and data locality in nested loops,” Ph.D. dissertation, Stanford Univ., 1991, in preparation.
24. M. E. Wolf and M. S. Lam, “A data locality optimizing algorithm,” in Proc. ACM SIGPLAN '91 Conf. Programing Language Design Implementation, June 1991, pp. 30–44.
25. M. J. Wolfe, “More iteration space tiling,” in Proc. Supercomputing '89, Nov. 1989.
26. M. Wolfe, Optimizing Supercompilers for Supercomputers. Cambridge, MA: MIT Press. 1989.