Transformations of nested loops with non-convex iteration spaces

Parallel Computing

Volumn 22, Issue 3, 1996, Pages 339-368

  Xue, Jingling ^a  

^a UNIVERSITY OF NEW ENGLAND   (Australia)

Author keywords

Loop transformation; Maximal normal form; Minimal normal form; Nested loops; Non convex iteration space; Parallel processing; Quasi convex polyhedron; SPMD

Indexed keywords

DISTRIBUTED MEMORY PARALLEL MACHINES; LOOP TRANSFORMATION; MAXIMAL NORMAL FORM; MINIMAL NORMAL FORM; NESTED LOOPS; NON CONVEX ITERATION SPACE; QUASI CONVEX POLYHEDRON;

COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; DATA TRANSFER; DISTRIBUTED COMPUTER SYSTEMS; ITERATIVE METHODS; MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA;

PARALLEL PROCESSING SYSTEMS;

EID: 0030100687     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8191(95)00069-0     Document Type: Article

References (19)

1. R. Allen and K. Kennedy, Automatic translation of FORTRAN programs to vector form. ACM Trans. on Programming Languages and Systems 9(4): (Oct. 1987) 491-542.
2. C. Ancourt, Code generation for data movements in hierarchical memory machines, In: Int. Workshop on Compilers for Parallel Computers (Dec. 1990) 91-102.
3. C. Ancourt and F. Irigoin, Scanning polyhedra with DO loops, In: Proc. Third ACM SIGPLAN Symp. on Principles & Practice of Parallel Programming (PPoPP) (ACM Press, Apr. 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 (Jun. 1993).
5. Z. Chamski, Nested loop sequences: Towards efficient loop structures in automatic parallelization, In: 27th Hawaii Inte. Conf. on System Sciences, vol. II: Software Technology (1994) 14-22.
6. M.C. Cheng, General criteria for redundant and nonredundant linear inequalities, J. Optimization Theory and Applications 53(1) (Apr. 1987) 37-42.
7. P. Feautrier Parametric integer programming, Operations Research 22 (1988) 243-268.
8. K. Gallivan, W. Jalby and D. Gannon, On the problem of optimizaing data transfers for complex memory systems, In Proc. Supercomputing '88 (ACM Press, 1988) 238-253.
9. D. Gannon, W. Jalby and K. Gallivan, Strategies for cache and local memory management by global program transformation, J. Parallel Distributed Computing 5 (1988) 587-616.
10. S. Hiranandani, K. Kennedy and C.W.-Tseng, Compiling Fortran D for MIMD distributed memory machines, Commun. ACM 35(8) (Aug. 1992) 66-80.
11. S. Hiranandani, K. Kennedy and C.W.-Tseng, Preliminary experiences with the Fortran D compiler, In: Proc. Supercomputing '93 (IEEE Computer Society Press, Nov. 1993) 338-350.
12. C. Koelbel, Compile-time generation of regular communication patterns, In: Proc. Supercomputing '91 (ACM Press, 1991) 101-110.
13. W. Li and K. Pingali, A singular loop transformation framework based on non-singular matrices, In: U. Banerjee, D. Gelernter, A. Nicolau and D. Padua, editors, Languages and Compilers for Parallel Computing, Lecture Notes in Computer Science 757 (Springer-Verlag, 1992) 391-405.
14. P. Quinton and V. van Dongen, The mapping of linear recurrence equations on regular arrays, J. VLSI Signal Processing 1(2) (Oct. 1989) 95-113.
15. M. Wolf and M. Lam, A loop transformation theory and an algorithm to maximize parallelism, IEEE Trans. Parallel and Distributed Systems 2(4) (Oct. 1991) 452-471.
16. M.J. Wolfe, More iteration space tiling, In: Proc. Supercomputing '88 (1989).
17. M.J. Wolfe, Optimizing Supercompilers for Supercomputers, Research Monographs in Parallel and Distributed Computing (MIT Press, 1989).
18. J. Xue, Automating non-unimodular loop transformations for massive parallelism, Parallel Computing 20(5) (1994) 711-728.
19. J. Xue, Closed-form mapping conditions for the synthesis of linear processor arrays, J. VLSI Signal Processing 10(2) (1995) 181-199.