A Geometric Programming Framework for Optimal Multi-Level Tiling

Proceedings of the ACM/IEEE SC 2004 Conference: Bridging Communities

Volumn , Issue , 2004, Pages

  Renganarayana, L ^a   Rajopadhye, S ^a  

^a Colorado State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; MATHEMATICAL PROGRAMMING; OPTIMIZATION; SYSTEMS ANALYSIS;

BANDWIDTH CONSTRAINT; CLASSICAL PROBLEMS; CONVEX OPTIMIZATION PROBLEMS; GEOMETRIC PROGRAMMING; HIGH-LEVEL MODELING; MULTI-LEVEL TILING; OVERALL EXECUTION; PERFORMANCE TUNING;

STRUCTURED PROGRAMMING;

EID: 84934300040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2004.3     Document Type: Conference Paper

References (38)

1. J. Abella, A. Gonzalez, J. Llosa, and X. Vera. Near-optimal loop tiling by mean of cache miss equations and genetic, algorithms. In Proceedings of International Conference on Parallel Processing Workshops, 2002.
2. R Andonov, S. Balev, S Rajopadhye, and N. Yanev. Optimal semi-oblique tiling. IEEE Transactions on Parallel and Distributed Systems, 14(9):944-960, 2003.
3. Jeff Bilmes, Krste Asanovic, Chee-Whye Chin, and Jim Demmel. Optimizing matrix multiply using phipac: a portable, high-performance, ansi c coding methodology. In Proceedings of the 11th international conference on Supercomputing, pages 340-347. ACM Press, 1997.
4. Stephen Boyd and Lieven Vandenherghe. Convex Optimization. Cambridge University Press. An online version available at the web site http://www.stanford.edu/~boydas~boyd/cvxbook.html), 2004.
5. Doug Burger and Todd M. Austin. The simplescalar tool set, version 2.0. SIGARCH Comput. Archit-News, 25(3):13 25, 1997.
6. L. Carter, J. Ferrante, F. Hummel, B. Alpern, and K. S. Gatlin. Hierarchical tiling: A methodology for high performance. Technical Report CS96-508, UCSD, Nov. 1996.
7. Calin Cascaval and David A. Padua. Estimating cache misses and locality using stack distances. In Proceedings of the 17th annual international conference on Supercomputing, pages 150-159. ACM Press, 2003.
8. Jacqueline Chame and Sungdo Moon. A tile selection algorithm for data locality and cache interference. In Proceedings of the 13th international conference on Supercomputing, pages 492-499. ACM Press, 1999.
9. Siddhartha Chatterjee, Erin Parker, Philip J. Hanlon, and Alvin R. Lebeck. Exact analysis of the cache behavior of nested loops. In Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, pages 286-297. ACM Press, 2001.
10. Philippe Clauss. Counting solutions to linear and nonlinear constraints through ehrhart polynomials: applications to analyze and transform scientific programs. In Proceedings of the 10th international conference on Supercomputing, pages 278-285. ACM Press, 1996.
11. Stephanie Coleman and Kathryn S. McKinley. Tile size selection using cache organization and data layout. In Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, pages 279-290. ACM Press, 1995.
12. R. J. Duffin, E. L. Peterson, and C. Zener. Geometric Programming - Theory and Applications. John Wiley, 1967.
13. J. Ferrante, V. Sarkar, and W. Thrash. On estimating and enhancing cache effectiveness. In U. Banerjee, D. Gelernter, A. Nicolau, and D Padua, editors, Fourth International Workshop on Languages and Compilers for Parallel Computing, pages 328-343. Lecture Notes on Computer Science 589, Springer Verlag, August, 1991.
14. Somnath Ghosh, Margaret Martonosi, and Sharad Malik. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Trans. Program. Lang. Syst., 21(4):703-746, 1999.
15. John S. Harper, Darren J. Kerbyson, and Graham R. Nudd. Analytical modeling of set-associative cache behavior. IEEE Trans. Comput., 48(10):1009 1024, 1999.
16. K. Hogstedt, L. Carter, and J. Ferrante. On the parallel execution time of tiled loops. IEEE Transactions on Parallel and Distributed Systems, 14(3):307-321, March 2003.
17. C. Hsu and U. Kremer. Tile selection algorithms and their performance models. Technical Report DCS-TR-401, CS Dept., Rutgers University, Oct. 1999.
18. F. Irigoin and R. Triolet. Supernode partitioning. In 15th ACM Symposium on Principles of Programming Languages, pages 319-328. ACM, Jan 1988.
19. M. Jimenez, J. M. Llaberia, and A. Fernandez. A cost-effective implementation of multilevel tiling. IEEE Transactions on Parallel and Distributed Computing, 14(10):1006 1020, 2003.
20. K. O. Kortanek, Xiaojie Xu, and Yinyu Yc. An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. Program., 76(1):155-181, 1997.
21. Computational Optimization Laboratory. User's guide of COPL-GP: Compuational optimization program lihary: Geometric programming. (available at: http://dollar.biz.uiowa.edu/col/). Technical Report Department of Management Science, The University of Iowa, May 2000.
22. Monica D. Lam, Edward E. Rothberg, and Michael E. Wolf. The cache performance and optimizations of blocked algorithms. In Proceedings of the fourth international conference on Architectural support for programming languages and operating systems, pages 63-74. ACM Press, 1991.
23. N. Mitchell, N. Hogstedt, L. Carter, and J. Ferrante. Quantifying the multi-level nature of tiling interactions. International Journal of Parallel Programming, 26(6):641 670, 1998.
24. MOSEK optimization tools. see http://www.mosek.com/products/3/tools/help.
25. Juan J. Navarro, Toni Juan, and Tomas Lang. Mob forms: a class of multilevel block algorithms for dense linear algebra operations. In Proceedings of the 8th international conference on Supercomputing, pages 354-363. ACM Press, 1994.
26. Gabriel Rivera and Chau-Wen Tseng. Data transformations for eliminating conflict misses. In Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation, pages 38-49. ACM Press, 1998.
27. Gabriel Rivera and Chau-Wen Tseng. Eliminating conflict misses for high performance architectures. In Proceedings of the 12th international conference on Supercomputing, pages 353-360. ACM Press, 1998.
28. V. Sarkar. Automatic selection of high-order transformations in the IBM xl fortran compilers. IBM J. Res. Dev., 41(3):233-264, 1997.
29. V. Sarkar and N. Megiddo. An analytical model for loop tiling and its solution. In Proceedings of ISPASS, 2000.
30. R. Schreiber and J. Dongarra. Automatic blocking of nested loops. Technical Report 90.38, RIACS, NASA Ames Research Center, Aug. 1990.
31. O. Temam, C. Fricker, and W. Jalby. Cache interference phenomena. In Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems, pages 261-271. ACM Press, 1994.
32. O. Temam, E. D. Granston, and W. Jalby. To copy or not to copy: a compile-time technique for assessing when data copying should be used to eliminate cache conflicts. In Proceedings of the 1993 ACM/IEEE conference on Supercomputing, pages 410-419. ACM Press, 1993.
33. Leslie G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103 111, 1990.
34. R. Clint Whalcy and Jack J. Dongarra. Automatically tuned linear algebra software. In Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM), pages 1-27. IEEE Computer Society, 1998.
35. M. Wolf, D. Maydan, and D. Chen. Combining loop transformations considering caches and scheduling. In 29th International Symposium on Microarchitecture, December 1996.
36. M. J. Wolfe. Iteration space tiling for memory hierarchies. Parallel Processing for Scientific Computing (SIAM), pages 357-361, 1987.
37. D. Wonnacott. Time skewing for parallel computers. In LCPC 1999: 12th International Workshop on Languages and Compilers for Parallel Computing, pages 477-480. Springer Verlag, 1999. See the file wonnacott.pdf at http://ipdps.eece.unm.edu/2000/papers for a more detailed version.
38. Jingling Xue. Loop Tiling For Parallelism. Kluwer Academic Publishers, 2000.