Optimal orthogonal tiling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1470 LNCS, Issue , 1998, Pages 480-490

  Andonov, Rumen ^a   Rajopadhye, Sanjay ^b   Yanev, Nicola ^c  

^a UNIVERSITÉ DE VALENCIENNES   (France)

^b CAMPUS DE BEAULIEU   (France)

^c UNIVERSITY OF SOFIA   (Bulgaria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLOSED FORM SOLUTIONS; DOMAIN BOUNDARY; ITERATION DOMAIN; ITERATION SPACES; OPTIMIZATION PROBLEMS; PARALLELIZING COMPILER; PERFORMANCE TUNING; PROGRAMMING MODELS;

GEOMETRY;

EID: 70350749986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0057891     Document Type: Conference Paper

References (17)

1. R. Andonov, H. Bourzoufi, and S. Rajopadhye. Two-dimensional orthogonal tiling: from theory to practice. In International Conference on High Performance Computing, pages 225-231, Timvananthapuram, India, December 1996. IEEE.
2. R. Andonov and S. Rajopadhye. Optimal orthogonal tiling of 2-d iterations. Journal of Parallel and Distributed Computing, 45(2):159-165, September 1997.
3. R. Andonov, N. Yanev, and H. Bourzoufi. Three-dimensional orthogonal tile sizing problem: Mathematical programming approach. In ASAP 97: International Conference on Application-Specific Systems, Architectures and Processors, pages 209-218, Zurich, Switzerland, July 1997. IEEE, Computer Society Press.
4. S. Bokhari. Communication overheads on the Intel iPSC-860 Hypercube. Technical Report Interim Report 10, NASA ICASE, May 1990.
5. P. Boulet, A. Darte, T. Risset, and Y. Robert, (pen)-ultimate tiling? INTEGRATION, the VLSI journal, 17:33-51, Nov? 1994.
6. S. Hiranandani, K. Kennedy, and C-W. Tseng. Evaluating compiler optimizations for Fortran D. Journal Of Parallel and Distributed Computing, 21:27-45, 1994.
7. F. Irigoin and R. Triolet. Supernode partitioning. In 15th ACM Symposium on Principles of Programming Languages, pages 319-328. ACM, Jan 1988.
8. R. M. Karp, R. E. Miller, and S. V. Winograd. The organization of computations for uniform recurrence equations. JACM, 14(3):563-590, July 1967.
9. C-T. King, W-H. Chou, and L. Ni. Pipelined data-parallel algorithms: Part I- concept and modelling. IEEE Transactions on Parallel and Distributed Systems, l(4):470-485, October 1990.
10. C-T. King, W-H. Chou, and L. Ni. Pipelined data-parallel algorithms: Part II-design. IEEE Transactions on Parallel and Distributed Systems, l(4):486-499, October 1990.
11. W. F. McColl. Scalable computing. In J. van Leeuwen, editor, Computer Science Today: Recent Trends and Developments, volume 1000, pages 46-61. Springer Verlag, 1995.
12. H. Ohta, Y. Saito, M. Kainaga, and H. Ono. Optimal tile size adjsutment in compiling general DOACROSS loop nests. In International Conference on Super-computing, pages 270-279, Barcelona, Spain, July 1995. ACM.
13. D. Palermo, E. Su, J. Chandy, and P. Banerjee. Communication optimizations used in the PARADIGM compiler for distributed memory multicomputers. In International Conference on Parallel Processing, pages xx-yy, St. Charles, IL, August 1994. IEEE.
14. J. Ramanujam and P. Sadayappan. Tiling multidimensional iteration spaces for non shared-memory machines. In Supercomputing 91, pages 111-120, 1991.
15. R. Schreiber and J. Dongarra. Automatic blocking of nested loops. Technical Report 90.38, RIACS, NASA Ames Research Center, Aug 1990.
16. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103-111, August 1990.
17. M. J. Wolfe. Iteration space tiling for memory hierarchies. Parallel Processing for Scientific Computing (SIAM), pages 357-361, 1987