Towards optimal multi-level tiling for stencil computations

Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM

Volumn , Issue , 2007, Pages

  Renganarayana, Lakshminarayanan ^a   Harthikote Matha, Manjukumar ^a   Dewri, Rinku ^a   Rajopadhye, Sanjay ^a  

^a Department of Environmental and Radiological Health Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROGRAM PROCESSORS;

DESIGN-SPACE EXPLORATION; PROCESSOR ARCHITECTURE; STENCIL COMPUTATIONS;

COMPUTATION THEORY;

EID: 34548752231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2007.370291     Document Type: Conference Paper

References (32)

1. R. Andonov, S. Balev, S. V. Rajopadhye, and N. Yanev. Optimal semi-oblique tiling. IEEE Trans. Parallel Distrib. Syst., 14(9):944-960, 2003.
2. R. Bordawekar, A. Choudhary, and J. Ramanujam. Automatic optimization of communication in compiling out-ofcore stencil codes. In ICS '96: Proceedings of the 10th international conference on Supercomputing, 1996.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
4. M. Bromley, S. Heller, T. McNerney, and J. Guy L. Steele. Fortran at ten Gigaflops: the connection machine convolution compiler. In PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, 1991.
5. A. Darte. Regular partitioning for synthesizing fixed-size systolic arrays. Integration, The VLSI J., 12(3):293-304, 1991.
6. M. A. Frumkin and R. F. V. der Wijngaart. Tight bounds on cache use for stencil operations on rectangular grids. J. ACM, 49(3):434-453, 2002.
7. W. D. Gropp. Solving pdes on loosely-coupled parallel processors. Parallel Computing, 5(1-2):165-173, 1987.
8. K. Högstedt, L. Carter, and J. Ferrante. Determining the idle time of a tiling. In POPL, 1997.
9. Y. C. Hu, G. Jin, S. L. Johnsson, D. Kehagias, and N. Shalaby. Hpfbench: a high performance fortran benchmark suite. ACM Trans. Math. Softw., 26(1):99-149, 2000.
10. F. Irigoin and R. Triolet. Supernode partitioning. In POPL '88: Proceedings of the 15th ACM SICPLAN-SICACT symposium on Principles of programming languages, 1988.
11. S. Kamil, P. Husbands, L. Oliker, J. Shalf, and K. Yelick. Impact of modern memory subsystems on cache optimizations for stencil computations. In MSP '05: Proceedings of the 2005 workshop on Memory system performance, 2005.
12. R. M. Karp, R. E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. J. ACM, 14(3):563-590, 1967.
13. K. O. Kortanek, X. Xu, and Y. Ye. An infeasible interiorpoint algorithm for solving primal and dual geometric programs. Math. Program., 76(1):155-181, 1997.
14. Z. Li and Y. Song. Automatic tiling of iterative stencil loops. ACM Trans. Program. Lang. Syst., 26(6):975-1028, 2004.
15. J. Löfberg. YALMIP : A toolbox for modeling and optimization in MATLAB. In Proceedings of the CACSD Conference, 2004.
16. N. Mitchell, K. Högstedt, L. Carter, and J. Ferrante. Quantifying the multi-level nature of tiling interactions. International J. of Parallel Programming, 26(6):641-670, 1998.
17. D. I. Moldovan and J. A. B. Fortes. Partitioning and mapping algorithms into fixed size systolic arrays. IEEE Trans. Comput., 35(1)--12, 1986.
18. NAS Parallel Benchmarks. Available from http://www.netlib.org/parkbench/.
19. PARKBENCH: PARallel Kernels and BENCHmarks. Available from http://www.netlib.org/parkbench/.
20. P. Quinton and V. Van Dongen. The mapping of linear recurrence equations on regular arrays. Journal of VLSI Signal Processing, 1(2):95-113, 1989.
21. S. V. Rajopadhye and R. M. Fujimoto. Synthesizing systolic arrays from recurrence equations. Parallel Computing, 14:163-189, June 1990.
22. L. Renganarayana and S. Rajopadhye. A geometric programming framework for optimal multi-level tiling. In SC '04: Proceedings of the ACM/IEEE conference on Supercomputing, 2004.
23. G. Rivera and C.-W. Tseng. Tiling optimizations for 3d scientific computations. In Supercomputing '00: Proceedings of the ACM/IEEE conference on Supercomputing, 2000.
24. G. Roth, J. Mellor-Crummey, K. Kennedy, and R. G. Brickner. Compiling stencils in high performance fortran. In Supercomputing '97: Proceedings of the ACM/IEEE conference on Supercomputing, 1997.
25. SPEC CPU2000 benchmark, http://www.spec.org.
26. R. C. Whaley and J. J. Dongarra. Automatically tuned linear algebra software. In Supercomputing '98: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), 1998.
27. M. E. Wolf and M. S. Lam. A data locality optimizing algorithm. In PLDI '91: Proceedings of the ACM SICPlAN 1991 conference on Programming language design and implementation, 1991.
28. M. Wolfe. More iteration space tiling. In Supercomputing '89: Proceedings of the 1989 ACM/IEEE conference on Supercomputing, 1989.
29. D. Wonnacott. Using time skewing to eliminate idle time due to memory bandwidth and network limitations. In IPDPS '00: Proceedings of the 14th International Symposium on Parallel and Distributed Processing, 2000.
30. D. Wonnacott. Achieving scalable locality with time skewing. Int. J. Parallel Program., 30(3):181-221, 2002.
31. J. Xue. On tiling as a loop transformation. Parallel Processing Letters, 7(4):409-424, 1997.
32. J. Xue. Loop tiling for parallelism. Kluwer Academic Publishers, 2000.