Tiling nested loops into maximal rectangular blocks

Journal of Parallel and Distributed Computing

Volumn 35, Issue 2, 1996, Pages 123-132

  Chen, Yeong Sheng ^a   Wang, Sheng De ^b   Wang, Chien Min ^c  

^a HWA HSIA INSTITUTE OF TECHNOLOGY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030585583     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0075     Document Type: Article

References (27)

1. 1. Ancourt, C., and Irigoin, F. Scanning polyhedra with Do loops. Proc. ACM SIGPLAN Symp. on Principles & Practice of Parallel Programming. 1991, pp. 39-50.
2. 2. Banerjee, U. Dependence Analysis for Supercomputing. Kluwer Academic, Boston, 1988.
3. 3. Darte, A., and Robert, Y. Constructive methods for scheduling uniform loop nests. IEEE Trans. Parallel Distrib. Systems 5, 8 (Aug. 1994), 814-822.
4. 4. D'Hollander, E. H. Partitioning and labeling of loops by unimodular transformations. IEEE Trans. Parallel Distrib. Systems 3, 4 (July 1992), 465-476.
5. 5. Fortes, J. A. B., and Parisi-Presicce, F., Optimal linear schedules for the parallel execution of algorithms. Proc. Int. Conf. on Parallel Processing. 1984, pp. 322-329.
6. 6. Gannon, D., Jalby, W., and Gallivan, K. Strategies for cache and local memory management by global program transformation. J. Parallel Distrib. Comput. 5, 10 (Oct. 1988), 587-616.
7. 7. Irigoin, F. Partitionnement des boucles imbriquées: Une technique d'optimisation pour les programmes scientifiques. Ph.D. thesis, Université de Paris VI, Paris, 1987.
8. 8. Irigoin, F., and Triolet, R. Supernode partitioning. Proc. 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages. 1988, pp. 319-329.
9. 9. King, C., and Ni, L. M. Grouping in nested loops for parallel execution on multicomputers. Proc. Int. Conf. Parallel Processing, Vol. II. 1989, pp. 31-38.
10. 10. Kuck, D. J., Muraoka, Y., and Chen, S.-C. On the number of operations simultaneously executable in FORTRAN-like programs and their resulting speed-up. IEEE Trans. Comput. 21, 12 (Dec. 1972), 1293-1310.
11. 11. Lamport, L. The parallel execution of do loops. Comm. ACM 17, 2 (Feb. 1974), 83-93.
12. 12. Li, W., and Pingali, K. A singular loop transformation framework based on non-singular matrices. J. Parallel Programming 22, 2 (Apr. 1994), 183-205.
13. 13. Nicolau, A. Loop quantization: A generalized loop unwinding technique. J. Parallel Distrib. Comput. 5, 10 (Oct. 1988), 568-586.
14. 14. Peir, J.-K., and Cytron, R. Minimum distance: A method for partitioning recurrences for multiprocessors. IEEE Trans. Comput. 38, 8 (Aug. 1989), 1203-1211.
15. 15. Polychronopoulos, C. D. Parallel Programming and Compilers. Kluwer Academic, Dordrecht/Norwell, MA, 1988.
16. 16. Polychronopoulos, C. D. Compiler optimizations for enhancing parallelism and their impact on architecture design. IEEE Trans. Comput. 27, 8 (Aug. 1988), 991-1004.
17. 17. Ramanujam, J. Non-unimodular transformations of nested loops. Proc. Supercomputing '92. 1992, pp. 214-223.
18. 18. Ramanujam, J., and Sadayappan, P. Tiling multidimensional iteration space for multicomputers, J. Parallel Distrib. Comput. 16, 2 (Oct. 1992), 108-120.
19. 19. Risset, T. A method to synthesize modular systolic arrays with local broadcast facility. Proc. Int. Conf. Application Specific Array Processors. 1992, pp. 415-428.
20. 20. Schreiber, R., and Dongarra, J. Automatic blocking of nested loops. Tech. Rep. CS-90-108, Univ. of Tennessee, Knoxville, TN, 1990.
21. 21. Shang, W., and Fortes, J. A. B. Time optimal linear schedules for algorithms with uniform dependencies. IEEE Trans. Comput. 40, 6 (Jun. 1991), 723-742.
22. 22. Shang, W., and Fortes, J. A. B. Independent partitioning of algorithms with uniform dependencies. IEEE Trans. Comput. 41, 2 (Feb. 1992), 190-206.
23. 23. Wolf, M. E., and Lam, M. S. A data locality optimizing algorithm. Proc. ACM SIGPLAN 1991 Conf. Programming Language Design Implementation. 1991, pp. 30-44.
24. 24. Wolf, M. E., and Lam, M. S. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distrib. Systems 2, 4 (Oct. 1991), 452-471.
25. 25. Wolfe, M. More iteration space tiling. Proc. Supercomputing '89. 1989, pp. 655-664.
26. 26. Wolfe, M. Optimizing Supercompilers for Supercomputers. MIT Press, Cambridge, MA, 1989.
27. 27. Zima, H., and Chapman, B. Supercompilers for Parallel and Vector Computers, Addison-Wesley, New York, 1990.