Unimodular transformations of non-perfectly nested loops

Parallel Computing

Volumn 22, Issue 12, 1997, Pages 1621-1645

  Xue, Jingling ^a  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

Author keywords

Data dependence; Feautrier's PIP; Fourier Motzkin elimination; Imperfect loop nest; Non Basic to Basic Loop transformation; Unimodular transformation

Indexed keywords

CODE GENERATION METHOD; FOURIER-MOTZKIN ELIMINATION; IMPERFECT LOOP NEST; UNIMODULAR TRANSFORMATION;

CODES (SYMBOLS); ITERATIVE METHODS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS;

PARALLEL ALGORITHMS;

EID: 0031079360     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(96)00063-4     Document Type: Article

References (31)

1. W. Abu-Sufah, Improving the performance of virtual memory computers, Ph.D. Thesis, University of Illinois at Urbana-Champaign, 1978.
2. S.P. Amarasinghe, J.M. Anderson, M.S. Lam and A.W. Lim. An overview of a compiler for a scalable parallel machines, in: Proc. 7th Workshop on Languages and Compilers for Parallel Computing (1993) 253-272.
3. C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, in: Proc. 3rd ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (PPoPP) (ACM Press, 1991) 39-50.
4. S.P. Armarasinghe and M.S. Lam, Communication optimisation and code generation for distributed memory machines, in; Proc. ACM SIGPLAN'93 Conf. on Programming Language Design and Implementation, 1993.
5. U. Banerjee, Dependence Analysis for Supercomputing. Engineering and Computer Science: Parallel Processing and Fifth Generation Computing (Kluwer Academic Publishers, 1988).
6. U. Banerjee, Unimodular transformations of double loops, in: A. Nicolau, D. Gelernter, T. Gross and D. Padua, eds., Advances in Languages and Compilers for Parallel Processing (MIT Press, Cambridge, MA, 1991), Chapter 10, 192-219.
7. Z. Chamski, Fast and efficient generation of loop bounds, in: D. Trystram, ed., Proc. Hawaii Internat. Conf. on Parallel Computing (North-Holland, Amsterdam, 1993).
8. Z. Chamski, Nested loop sequences: Towards efficient loop structures in automatic parallelization, in: Proc. 27th Internat. Conf. on System Sciences, Volume II: Software Technology (1994) 14-22.
9. M.C. Cheng, General criteria for redundant and nonredundant linear inequalities, J. Optimization Theory Appl. 53 (1) (1987) 37-42.
10. J.-F. Collard, T. Risset and P. Feautrier, Construction of DO loops-from systems of affine constraints, Tech. Rept. 93-15, Ecole Normale Supérieure de Lyon, 1993.
11. M. Cosnard and M. Loi, A simple algorithm for the generation of efficient loop boujids, Internat. J. Parallel Programming, 24 (3) (1996) 265-289.
12. P. Feautrier, Parametric integer programming, Oper. Res. 22 (1988) 243-268.
13. P. Feautrier, Dataflow analysis of array and scalar references, Internat. J. Parallel Programming 20 (1) (1991) 23-53.
14. P. Feautrier, Some efficient solutions to the affine scheduling problem. Part I, one-dimensional time, Internat. 3. Parallel Programming 21 (5) (1992) 313-348.
15. P. Feautrier, Some efficient solutions to the affine scheduling problem, Part II, multidimensional time, Internat. J. of Parallel Programming 21 (6) (1992) 389-420.
16. W. Kelly and W. Pugh, A framework for unifying reordering transformations, Tech. Rept. CS-TR-2995, Dept. of Computer Science, University of Maryland, 1993.
17. W. Kelly and W. Pugh, Selecting affine mappings based on performance estimations, Parallel Process. Lett. 4 (1994) 205-220.
18. 3PP) (IEEE Computer Society Press, 1995) 153-612.
19. A.W. Lim and M.S. Lam, Communication-free parallelization via affine transformations, in: Proc. 7th Workshop on Languages and Compilers for Parallel Computing (1994) 92-106.
20. D.E. Maydan, J.L. Hennessy and M.S. Lam, Efficient and exact data dependence analysis, in: Proc. SIGCPLAN 1991 PLDI (1991) 1-14.
21. W. Pugh, The Omega test: A fast and practical integer programming algorithm for dependence analysis, Comm. ACM 35 (8) (1992) 102-114.
22. W. Pugh and D. Wonnacott, Going beyond integer programming with the Omega test to eliminate false data dependences, Tech. Rept. CS-TR-3191, Dept. of Computer Science, University of Maryland, 1992; Earlier version at SIGPLAN PLDI's 92 Conference.
23. R. Sass and M. Mutka, Enabling unimodular transformations, in: Supercomputing '94 (IEEE Computer Society Press, 1994).
24. A. Schrijver, Theory of Linear and Integer Programming, Series in Discrete Mathematics (Wiley, 1986).
25. Z. Shen, Z. Li and P.C. Yew, An empirical study on array subscripts and data dependences, in: Proc. Internat. Conf. on Parallel Processing (1989) 145-150.
26. M. Wolf and M. Lam, A loop transformation theory and an algorithm to maximize parallelism, IEEE Trans. Parallel Distributed Systems 2 (4) (1991) 452-471.
27. M.E. Wolf, Improving locality and parallelism in nested loops, Ph.D. Thesis, Standford University, 1992.
28. M.J. Wolfe, Optimizing Supercompilers for Supercomputers, Research Monographs in Parallel and Distributed Computing (MIT Press, Cambridge, MA, 1989).
29. J. Xue, Automating non-unimodular loop transformations for massive parallelism, Parallel Computing 20 (5) (1994) 711-728.
30. J. Xue, Transformations of nested loops with non-convex iteration spaces, Parallel Computing 22 (1996) 339-368.
31. Y.Q. Yang, C. Ancourt and F. Irigoin, Minimal data dependence abstractions for loop transformations, in: Proc. 7th Workshop on Languages and Compilers for Parallel Computing, Ithaca, NY, 1994.