Positivity, posynomials and tile size selection

2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2008

Volumn , Issue , 2008, Pages

  Renganarayana, Lakshminarayanan ^a   Rajopadhye, Sanjay ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

COST MODELS; DATA LOCALITY; FUNDAMENTAL PROPERTIES; LOOP TRANSFORMATION; MULTIPLE LEVELS; TILE SIZE;

COMPUTER SCIENCE; GRAPHICAL USER INTERFACES; LOCAL AREA NETWORKS;

ION BEAMS;

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

References (57)

1. F. Irigoin and R. Triolet, "Supernode partitioning," in 15th ACM Symposium on Principles of Programming Languages. ACM, Jan 1988, pp. 319-328.
2. R. Schreiber and J. Dongarra, "Automatic blocking of nested loops," RIACS, NASA Ames Research Center, Tech. Rep. 90.38, Aug 1990.
3. M. S. Lam and M. E. Wolf, "A data locality optimizing algorithm (with retrospective)," in Best of PLDI, 1991, pp. 442-459.
4. J. Xue, Loop Tiling For Parallelism. Kluwer Academic Publishers, 2000.
5. L. Carter, J. Ferrante, and S. F. Hummel, "Hierarchical tiling for improved superscalar performance," in IPPS '95: Proceedings of the 9th International Symposium on Parallel Processing. Washington, DC, USA: IEEE Computer Society, 1995, pp. 239-245.
6. K. Yotov, X. Li, G. Ren, M. J. S. Garzaran, D. Padua, K. Pingali, and P. Stodghill, "Is search really necessary to generate high-performance BLAS?" Proceedings of the IEEE, vol. 93, pp. 358-386, 2005.
7. L. Renganarayanan, M. Harthi-kote, R. Dewri, and S. Rajopadhye, "Towards optimal multi-level tiling for stencil computations," in 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS) (to appear), 2007.
8. M. M. Baskaran, U. Bondhugula, S. Krishnamoorthy, J. Ramanujam, A. Rountev, and P. Sadayappan, "Automatic data movement and computation mapping for multi-level parallel architectures with explicitly managed memories," in PPoPP '08: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming. New York, NY, USA: ACM, 2008, pp. 1-10.
9. A. Agarwal, D. A. Kranz, and V. Natarajan, "Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessors," IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 9, pp. 943-962, 1995.
10. P. Boulet, A. Darte, T. Risset, and Y. Robert, "(pen)-ultimate tiling?" Integr. VLSI J., vol. 17, no. 1, pp. 33-51, 1994.
11. P.-Y. Calland and T. Risset, "Precise tiling for uniform loop nests," in ASAP '95: Proceedings of the IEEE International Conference on Application Specific Array Processors. Washington, DC, USA: IEEE Computer Society, 1995, p. 330.
12. E. Hodzic and W. Shang, "On supernode transformation with minimized total running time," IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 5, pp. 417-428, 1998.
13. H. Ohta, Y. Saito, M. Kainaga, and H. Ono, "Optimal tile size adjustment in compiling general DOACROSS loop nests," in ICS '95: Proceedings of the 9th international conference on Supercomputing. New York, NY, USA: ACM Press, 1995, pp. 270-279.
14. J. Ramanujam and P. Sadayappan, "Tiling multidimensional itertion spaces for multicomputers." J. Parallel Distrib. Comput., vol. 16, no. 2, pp. 108-120, 1992.
15. R. Andonov, S. Balev, S. V. Rajopadhye, and N. Yanev, "Optimal semioblique tiling." IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 9, pp. 944-960, 2003.
16. J. Xue, "Communication-minimal tiling of uniform dependence loops," J. Parallel Distrib. Comput., vol. 42, no. 1, pp. 42-59, 1997.
17. J. Xue and W. Cai, "Time-minimal tiling when rise is larger than zero," Parallel Comput., vol. 28, no. 6, pp. 915-939, 2002.
18. R. Andonov, S. V. Rajopadhye, and N. Yanev, "Optimal orthogonal tiling." in Euro-Par, 1998, pp. 480-490.
19. C. Hsu and U. Kremer, "Tile selection algorithms and their performance models," CS Dept., Rutgers University, Tech. Rep. DCS-TR-401, Oct. 1999.
20. J. Chame and S. Moon, "A tile selection algorithm for data locality and cache interference," in Proceedings of the 13th international conference on Supercomputing. ACM Press, 1999, pp. 492-499.
21. S. Coleman and K. 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. ACM Press, 1995, pp. 279-290.
22. F. Rastello and Y. Robert, "Automatic partitioning of parallel loops with parallelepiped-shaped tiles," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 5, pp. 460-470, 2002.
23. B. B. Fraguela, M. G. Carmueja, and D. Andrade, "Optimal tile size selection guided by analytical models." in PARCO, 2005, pp. 565-572.
24. V. Sarkar, "Optimized unrolling of nested loops." International Journal of Parallel Programming, vol. 29, no. 5, pp. 545-581, 2001.
25. M. Jiménez, J. M. Llabería, and A. Fernández, "Register tiling in nonrectangular iteration spaces." ACM Trans. Program. Lang. Syst., vol. 24, no. 4, pp. 409-453, 2002.
26. M. D. Lam, E. E. Rothberg, and M. 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. ACM Press, 1991, pp. 63-74.
27. V. Sarkar and N. Megiddo, "An analytical model for loop tiling and its solution," in Proceedings of ISPASS, 2000.
28. N. Mitchell, N. Hogstedt, L. Carter, and J. Ferrante, "Quantifying the multi-level nature of tiling interactions," International Journal of Parallel Programming, vol. 26, no. 6, pp. 641-670, 1998.
29. R. C. Whaley and J. J. Dongarra, "Automatically tuned linear algebra software," in Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM). IEEE Computer Society, 1998, pp. 1-27.
30. J. Bilmes, K. Asanovic, C.-W. Chin, and J. Demmel, "Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology," in Proceedings of the 11th international conference on Supercomputing. ACM Press, 1997, pp. 340-347.
31. T. Kisuki, P. M. W. Knijnenburg, and M. F. P. O'Boyle, "Combined selection of tile sizes and unroll factors using iterative compilation," in PACT '00: Proceedings of the 2000 International Conference on Parallel Architectures and Compilation Techniques. Washington, DC, USA: IEEE Computer Society, 2000, p. 237.
32. C. Chen, J. Chame, and M. Hall, "Combining models and guided empirical search to optimize for multiple levels of the memory hierarchy," in CGO '05: Proceedings of the international symposium on Code generation and optimization. Washington, DC, USA: IEEE Computer Society, 2005, pp. 111-122.
33. K. Yotov, K. Pingali, and P. Stodghill, "Think globally, search locally," in ICS '05: Proceedings of the 19th annual international conference on Supercomputing. New York, NY, USA: ACM, 2005, pp. 141-150.
34. P. M.W. Knijnenburg, T. Kisuki, K. Gallivan, and M. F. P. O'Boyle, "The effect of cache models on iterative compilation for combined tiling and unrolling: Research articles," Concurr. Comput. : Pract. Exper., vol. 16, no. 2-3, pp. 247-270, 2004.
35. R. Andonov and S. Rajopadhye, "Optimal orthogonal tiling of 2-D iterations," Journal of Parallel and Distributed Computing, vol. 45, no. 2, pp. 159-165, September 1997.
36. K. O. Kortanek, X. Xu, and Y. Ye, "An infeasible interior-point algorithm for solving primal and dual geometric programs," Math. Program., vol. 76, no. 1, pp. 155-181, 1997.
37. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge University Press. (Online version available at: http://www.stanford.edu/ ̃boyd/cvxbook.html), 2004.
38. R. Duffin, E. Peterson, and C. Zener, Geometric Programming - Theory and Applications. John Wiley, 1967.
39. S. Boyd, S. J. Kim, L. Vandenberghe, and A. Hassibi, "A tutorial on Geometric Programming," To appear in Optimization and Engineering, 2006.
40. C. hsing Hsu and U. Kremer, "A quantitative analysis of tile size selection algorithms," J. Supercomput., vol. 27, no. 3, pp. 279-294, 2004.
41. K. Esseghir, "Improving data locality for caches," Master's thesis, Rice University, September 1993.
42. S. Moon and R. Saavedra, "Hyperblocking: A data reorganization method to eliminate cache conflicts in tiled loop nests," University of Southern California, Tech. Rep. TR-98-671, February 1998.
43. M. Wolf, D. Maydan, and D. Chen, "Combining loop transformations considering caches and scheduling," in 29th International Symposium on Microarchitecture, December 1996.
44. G. Rivera and C.-W. Tseng, "A comparison of compiler tiling algorithms," in CC '99: Proceedings of the 8th International Conference on Compiler Construction. Springer-Verlag, 1999, pp. 168-182.
45. V. Sarkar, "Automatic selection of high-order transformations in the IBM XL FORTRAN compilers," IBM J. Res. Dev., vol. 41, no. 3, pp. 233-264, 1997.
46. L. Renganarayana and S. Rajopadhye, "A geometric programming framework for optimal multi-level tiling," in SC '04: Proceedings of the 2004 ACM/IEEE conference on Supercomputing. Washington, DC, USA: IEEE Computer Society, 2004, p. 18.
47. L. Renganarayana, R. Upadrasta, and S. Rajopadhye, "Optimal ILP and register tiling: Analytical model and optimization framework," in LCPC 2005: 12th International Workshop on Languages and Compilers for Parallel Computing. Springer Verlag, 2005.
48. K. Hogstedt, L. Carter, and J. Ferrante, "On the parallel execution time of tiled loops," IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 3, pp. 307-321, 2003.
49. D. Callahan, S. Carr, and K. Kennedy, "Improving register allocation for subscripted variables," in PLDI '90: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation. New York, NY, USA: ACM Press, 1990, pp. 53-65.
50. J. Ferrante, V. Sarkar, and W. Thrash, "On estimating and enhancing cache effectiveness," in Fourth International Workshop on Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, Eds. Lecture Notes on Computer Science 589, Springer Verlag, August 1991, pp. 328-343.
51. "An updated set of basic linear algebra subprograms (BLAS)," ACM Trans. Math. Softw., vol. 28, no. 2, pp. 135-151, 2002.
52. J. Löfberg, "YALMIP : A toolbox for modeling and optimization in MATLAB," in Proceedings of the CACSD Conference, Taipei, Taiwan, 2004, available from http://control.ee.ethz.ch/̃joloef/yalmip.php.
53. U. Bondhugula, A. Hartono, J. Ramanujam, and P. Sadayappan, "A practical and fully automatic polyhedral program optimization system," in ACM SIGPLAN PLDI, Jun. 2008.
54. P. 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. ACM Press, 1996, pp. 278-285.
55. S. Ghosh, M. Martonosi, and S. Malik, "Cache miss equations: a compiler framework for analyzing and tuning memory behavior," ACM Trans. Program. Lang. Syst., vol. 21, no. 4, pp. 703-746, 1999.
56. S. Chatterjee, E. Parker, P. J. Hanlon, and A. 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. ACM Press, 2001, pp. 286-297.
57. B. Meister and S. Verdoolaege, "Polynomial approximations in the polytope model: Bringing the power of quasi-polynomials to the masses," in ODES-6: 6th Workshop on Optimizations for DSP and Embedded Systems, Apr 2008, pp. 45-54.