Non-unimodular transformations of nested loops

Proceedings of the International Conference on Supercomputing

Volumn Part F129723, Issue , 1992, Pages 214-223

  Ramanujam, J ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; MEMORY ARCHITECTURE;

DEPENDENCE ANALYSIS; DISTRIBUTED MEMORY CODE; HERMITE NORMAL FORM; ITERATION SPACES; LINEAR-ALGEBRAIC; LOOP TRANSFORMATION; OPTIMIZING PROGRAMS; TRANSFORMATION MATRICES;

LINEAR TRANSFORMATIONS;

EID: 85031707006     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/superc.1992.236692     Document Type: Conference Paper

References (30)

1. J. R. Allen and K. Kennedy. Automatic Loop Interchange. Proc. SIGPLAN 84 Symposium on Compiler Construction, pages 233-246, June 1984.
2. J. R. Allen and K. Kennedy. Automatic Translation of FORTRAN Programs to Vector Form. ACM Trans. Programming Languages and Systems, Vol. 9, No. 4, pages 491-542, October 1987.
3. C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops. In Proc. Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), pages 39-50, April 1991.
4. A. Bachem. The Theorem of Minkowski for Polyhedral Monoids and Aggregated Linear Diophantine Systems. Optimization and Operations Research - Proc. of Workshop, University of Bonn, October 1977, Lecture Notes in Economics and Mathematical Systems, Vol. 157, pages 1-14, Springer Verlag.
5. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Boston, Massachusetts, 1988.
6. U. Banerjee. A Theory of Loop Permutations. Languages and Compilers for Parallel Computing, D. Gelernter, A. Nicolau and D. Padua (Eds.) Pitman, London, 1990, pp. 54-74.
7. U. Banerjee. Unimodular Transformation of Double Loops. Advances in Languages and Compilers for Parallel Processing, A. Nicolau et al., (Eds.), Pitman, London, 1991, pp. 192-219.
8. M. Barnett and C. Lengauer. Loop Parallelization and Unimodularity. Report ECS-LFCS-92-197, University of Edinburgh, 1992.
9. M. Dowling. Optimal Code Parallelisation using Unimodular Transformations. Preprints in Optimization, Carolo-Wilhelmina Universitat zu Braunschweig, W. Germany, July 1988.
10. S. Hiranandani, K. Kennedy and C. Tseng. Compiler Optimization for Fortran D on MIMD Distributed Memory Machines, in Proc. Supercomputing 91, pages 86-100, November 1991.
11. F. Irigoin and R. Triolet. Supernode Partitioning. Proc. 15th Annual ACM Symp. Principles of Programming Languages, San Diego, CA, Jan. 1988, 319-329.
12. L. Lamport. The Parallel Execution of DO Loops. Communications of the ACM, Vol. 17, No. 2, pages 83-93, February 1974.
13. W. Li and K. Pingali. A Singular Loop Transformation Framework Based on Non-singular Matrices. Proc. 5th Workshop on Languages and Compilers for Parallel Computing, August 1992.
14. L. Lu. A Unified Framework for Systematic Loop Transformations. In Proc. Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPoPP), pages 28-38, April 1991.
15. G. Nemhauser and L. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience series in Discrete Mathematics and Optimization, John Wiley and Sons, New York, 1988.
16. M. Newman. Integral Matrices. Academic Press, New York, 1972.
17. J. Ramanujam and P. Sadayappan. Tiling of Iteration Spaces for Multicomputers. Proc. 1990 International Conference on Parallel Processing, Vol 2, pages 179-186, August 1990.
18. J. Ramanujam. Compile-time Techniques for Parallel Execution of Loops on Distributed Memory Multiprocessors. Ph. D. Thesis, The Ohio State University, September 1990.
19. J. Ramanujam. A linear algebraic view of loop transformations and their interaction, in Parallel Processing for Scientific Computing, D. Sorensen (Editor), SIAM Press, March 1991.
20. J. Ramanujam and P. Sadayappan. Multidimensional Iteration Space Tiling for Nonshared Memory Machines, in Proc. Supercomputing 91, pages 111-120, November 1991.
21. H. Salkin and K. Mathur. Foundations of Integer Programming. North-Holland, New York, NY, 1989.
22. A. Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience series in Discrete Mathematics and Optimization, John Wiley and Sons, New York, 1986.
23. M. Wolf and M. Lam. A Loop Transformation Theory and an Algorithm to Maximize Parallelism. IEEE Trans. Parallel and Distributed Syst, October 1991.
24. M. Wolf and M. Lam. A Data Locality Optimizing Algorithm. Proc. ACM SIGPLAN 91 Conf. Programming Language Design and Implementation, pp. 30-44, June 1991.
25. M. Wolfe. Optimizing Supercompilers for Supercomputers. Pitman Publishing, London and the MIT Press, Cambridge, Massachusetts, 1989.
26. M. Wolfe. More Iteration Space Tiling. Proc. Supercomputing 89, Reno, Nevada, pages 655-664, November 1989.
27. M. Wolfe. Massive Parallelism through Program Restructuring. Tech. Report CS/E 90-009, Oregon Graduate Institute, June 1990.
28. M. Wolfe and U. Banerjee. Data Dependence and Its Application to Parallel Processing. International Journal of Parallel Programming, Vol. 16, No. 2, pages 137-178, 1987.
29. M. Wolfe and C. Tseng. The power test for data dependence. To appear in IEEE Trans. Parallel and Distributed Systems., 1992.
30. H. Zima and B. Chapman. Supercompilers for parallel and vector supercomputers. ACM Press Frontier Series, 1990.