Code generation methods for tiling transformations

Journal of Information Science and Engineering

Volumn 18, Issue 5, 2002, Pages 667-691

  Goumas, Georgios ^a   Athanasaki, Maria ^a   Koziris, Nectarios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

Author keywords

Code generation; Fourier Motzkin elimination; Loop tiling; Non unimodular transformations; Supernodes

Indexed keywords

CODES (SYMBOLS); DATA STORAGE EQUIPMENT; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PIPELINE PROCESSING SYSTEMS;

AUTOMATIC CODE GENERATION; CODE GENERATION METHODS; FOURIER-MOTZKIN ELIMINATIONS; MULTILEVEL MEMORY HIERARCHIES; SUPERNODE TRANSFORMATIONS; TILING TRANSFORMATIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 0036756475     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. J. Ramanujan, "Non-unimodular transformations of nested loops," in Proceedings of Supercomputing 92, 1992, pp. 214-223.
2. J. Ramanujam, "Beyond unimodular transformations," Journal of Supercomputing, Vol. 9, 1995, pp. 365-389.
3. J. Xue, "Automatic non-unimodular loop transformations for massive parallelism," Parallel Computing, Vol. 20, 1994, pp. 711-728.
4. A. Fernandez, J. Llaberia, and M. Valero, "Loop transformation using nonunimodular matrices," IEEE Transactions on Parallel and Distributed Systems, Vol. 6, 1995, pp. 832-840.
5. W. Li and K. Pingali, "A singular loop transformation framework based on non-singular matrices," in Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, 1992, pp. 249-260.
6. F. Irigoin and R. Triolet, "Supernode partitioning," in Proceedings of the 15th Annual ACM SIGACT-SIGPLAN Symposium Principles of Programming Languages, 1988, pp. 319-329.
7. J. Ramanujam and P. Sadayappan, "Tiling multidimensional iteration spaces for multicomputers," Journal of Parallel and Distributed Computing, Vol. 16, 1992, pp. 108-120.
8. P. Boulet, A. Darte, T. Risset, and Y. Robert, "(Pen)-ultimate tiling?," INTEGRATION, the VLSI Journal, Vol. 17, 1994, pp. 33-51.
9. J. Xue, "Communication-minimal tiling of uniform dependence loops," Journal of Parallel and Distributed Computing, Vol. 42, 1997, pp. 42-59.
10. J. Xue, "On tiling as a loop transformation," Parallel Processing Letters, Vol. 7, 1997, pp. 409-424.
11. W. Shang and J. A. B. Fortes, "Independent partitioning of algorithms with uniform dependencies," IEEE Transactions on Computers, Vol. 41, 1992, pp. 190-206.
12. E. H. Hollander, "Partitioning and labeling loops by unimodular transformations," IEEE Transactions on Parallel and Distributed Systems, Vol. 3, 1992, pp. 465-476.
13. M. Wolf and M. Lam, "A loop transformation theory and an algorithm to maximize parallelism," IEEE Transactions on Parallel and Distributed Systems, Vol. 2, 1991, pp. 452-471.
14. J. P. Sheu and T. S. Chen, "Partitioning and mapping nested loops for linear array multicomputers," Journal of Supercomputing, Vol. 9, 1995, pp. 183-202.
15. Chung-Ta King, W.-H. Chou, and L. Ni, "Pipelined data-parallel algorithms: part II design," IEEE Transactions on Parallel and Distributed Systems, Vol. 2, 1991, pp. 430-439.
16. P. Tsanakas, N. Koziris, and G. Papakonstantinou, "Chain grouping: a method for partitioning loops onto mesh-connected processor arrays," IEEE Transactions on Parallel and Distributed Systems, Vol. 57, 2000, pp. 941-955.
17. J. P. Sheu and T. H. Tai, "Partitioning and mapping nested loops on multiprocessor systems," IEEE Transactions on Parallel and Distributed Systems, Vol. 2, 1991, pp. 430-439.
18. I. Drossitis, G. Goumas, N. Koziris, G. Papakonstantinou, and P. Tsanakas, "Evaluation of loop grouping methods based on orthogonal projection spaces," in Proceedings of the 2000 International Conference on Parallel Processing (ICPP-2000), pp. 469-476.
19. E. Hodzic and W. Shang, "On supernode transformation with minimized total running time," IEEE Transactions on Parallel and Distributed Systems, Vol. 9, 1998, pp. 417-428.
20. G. Goumas, A. Sotiropoulos, and N. Koziris, "Minimizing completion time for loop tiling with computation and communication overlapping," International Parallel and Distributed Processing Symposium 2001 (IPDPS-2001).
21. E. Hodzic and W. Shang, "On time optimal supernode shape," in Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999.
22. P. Tang and J. Xue, "Generating efficient tiled code for distributed memory machines," Parallel Computing, 2000, pp. 1369-1410.
23. C. Ancourt and F. Irigoin, "Scanning polyhedra with DO loops," in Proceedings of the Third ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming, 1991, pp. 39-50.
24. W. Pugh, "The omega test: a fast and practical integer programming algorithm for dependence analysis," Communications of the ACM, 1992, pp. 102-114.
25. A. J. C. Bik and H. A. G. Wijshoff, "Implementation of fourier-motzkin elimination," in Proceedings of the 1st Annual Conference of the ASCI, 1995, pp. 377-386.