Optimal Orthogonal Tiling of 2-D Iterations

Journal of Parallel and Distributed Computing

Volumn 45, Issue 2, 1997, Pages 159-165

  Andonov, Rumen ^a   Rajopadhye, Sanjay ^b  

^a LIMAV   (France)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

Coarse grain pipelining; SPMD programs; loop blocking; nonlinear optimization; communication computation overlap; supernode partitioning; automatic parallelization; macro systolic arrays

Indexed keywords

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

References (18)

1. R. Andonov, H. Bourzoufi, S. Rajopadhye, December 1996, Two-dimensional orthogonal tiling: From theory to practice, International Conference on High Performance Computing, 225, 231, IEEE.
2. Andonov R., Rajopadhye S. Optimal tiling of two-dimensional uniform recurrences. Technical Report. PI-999:April 1996.
3. R. Andonov, N. Yanev, H. Bourzoufi, July 1997, Three-dimensional orthogonal tile sizing problem: Mathematical programming approach, ASAP 97: International Conference on Application-Specific Systems, Architectures and Processors, 209, 218, IEEE, Computer Society Press, Zurich, Switzerland.
4. Boulet P., Darte A., Risset T., Robert Y. (Pen)-ultimate tiling? INTEGRATION, the VLSI Journal. 17:Nov. 1994;33-51.
5. Bokhari S. Communication overheads on the Intel iPSC-860 Hypercube. Technical Report Interim Report. 10:May 1990.
6. P-Y. Calland, J. Dongarra, Y. Robert, July 1997, Tiling with limited resources, ASAP 97: IEEE Conference on Application Specific Systems Architectures and Processors, 229, 238, IEEE, Zurich, Switzerland.
7. Hiranandani S., Kennedy K., Tseng C-W. Evaluating compiler optimizations for Fortran D. J. Parallel Distrib. Comput. 21:1994;27-45.
8. F. Irigoin, R. Triolet, 1988, Supernode partitioning, 15th ACM Symposium on Principles of Programming Languages, 319, 328, ACM.
9. King C-T., Chou W-H., Li L. Pipelined data-parallel algorithms. I. Concept and Modelling. IEEE Trans. Parallel Distrib. Systems. 1:Oct. 1990;470-485.
10. King C-T., Chou W-H., Ni L. Pipelined data-parallel algorithms. II. Design. IEEE Trans. Parallel Distrib. Systems. 1:Oct. 1990;486-499.
11. Karp R. M., Miller R. E., Winograd S. V. The organization of computations for uniform recurrence equations. J. Assoc. Comput. Mach. 14:July 1997;563-590.
12. H. Ohta, Y. Saito, M. Kainaga, H. Ono, July 1995, Optimal tile size adjustment in compiling general DOACROSS loop nests, International Conference on Supercomputing, 270, 279, ACM, Barcelona, Spain.
13. D. Palermo, E. Su, J. Chandy, P. Banerjee, August 1994, Communication optimizations used in the PARADIGM compiler for distributed memory multicomputers, International Conference on Parallel Processing, IEEE, St. Charles, IL.
14. Quinton P., Robert Y. Systolic Algorithms and Architectures. 1989;Prentice-Hall/Masson.
15. J. Ramanujam, P. Sadayappan, 1991, Tiling multidimensional iteration spaces for non shared-memory machines, Supercomputing 91, 111, 120.
16. Schreiber R., Dongarra J. Automatic blocking of nested loops. Technical Report. 90.38:Aug. 1990.
17. M. J. Wolfe, 1987, Iteration space tiling for memory hierarchies, Parallel Processing for Scientific Computing, 357, 361, SIAM.
18. Zhong X., Rajopadhye S. V., Wong I. Systematic generation of linear allocation functions in systolic array design. J. VLSI Signal Processing. 4:Nov. 1992;279-293.