Loop optimization using hierarchical compilation and kernel decomposition

International Symposium on Code Generation and Optimization, CGO 2007

Volumn , Issue , 2007, Pages 170-182

  Barthou, Denis ^a   Donadio, Sebastien ^b,c   Carribault, Patrick ^b,c   Duchateau, Alexandre ^c   Jalby, William ^a,c  

^a UNIVERSITY OF VERSAILLES   (France)

^b BULL SAS   (France)

^c LABORATOIRE DES SCIENCES DU CLIMAT ET DE L ENVIRONNEMENT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; NETWORK ARCHITECTURE; OPTIMIZATION; PROGRAM COMPILERS;

MATRIX MULIPLY; OPTIMIZATION GOALS;

COMPUTER HARDWARE;

EID: 34547678265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2007.22     Document Type: Conference Paper

References (23)

1. Tiny C compiler, http://www.tinycc.org.
2. D. Barmou, A. Cohen, and J.-F. Collard. Maximal static expansion. In Symposium on Principles of Programming Languages, pages 98-106, 1998.
3. C. Chen, J. Chame, and M. W. Hall. Combining models and guided empirical search to optimize for multiple levels of the memory hierarchy. In CGO '05, pages 111-122, 2005.
4. P. Clauss. Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: Applications to analyze and transform scientific programs. In ICS '96, pages 278-295, 1996.
5. S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In PLDI '95, pages 279-290, 1995.
6. K. D. Cooper and T. Waterman. Investigating Adaptive Compilation using the MIPSPro Compiler. In Proc. of the Symp. of the Los Alamos Computer Science Institute, October 2003.
7. L. Djoudi, D. Barthou, P. Carribault, C. Lemuet, J.-T. Acquaviva, and W. Jalby. Exploring application performance: a new tool for a static/dynamic approach. In Proceedings of the 6th LACSI Symposium, Santa Fe, NM, Oct. 2005.
8. S. Donadio, J. Brodman, K.Yotov, T. Roeder, D. Barthou, A. Cohen, M. Garzaran, D. Padua, and K. Pingali. A language for the Compact Representation of Multiple Program Versions. In LCPC '05, Hawthorne, New York, Oct. 2005.
9. Engineering and scientific subroutine library. Guide and Reference. IBM.
10. P. Feautrier. Dataflow analysis of scalar and array references. Int. J. of Parallel Programming, 20(1):23-53, Feb. 1991.
11. B. B. Fraguela, R. Doallo, and E. L. Zapata. Automatic analytical modeling for the estimation of cache misses. In PACT '99, page 221, 1999.
12. K. Goto and R. van de Geijn. On reducing tlb misses in matrix multiplication. Technical report, The University of Texas at Austin, Department of Computer Sciences, 2002.
13. W. Jalby, C. Lemuet, and X. L. Pasteur. Wbtk: a new set of microbenchmarks to explore memory system performance for scientific computing. Int. J. High Perform. Comput. Appl., 18(2):211-224, 2004.
14. I. Kodukula, N. Ahmed, and K. Pingali. Data-centric multi-level blocking. In PLDI '97, pages 346-357, 1997.
15. I. Kodukula and K. Pingali. Transformations for imperfectly nested loops. In Supercomputing '96, page 12, 1996.
16. V. Lefebvre and P. Feautrier. Automatic storage management for parallel programs. Parallel Computing, 24(3-4):649-671, 1998.
17. Intel math kernel library (intel mkl). Intel.
18. W. Thies, F. Vivien, J. Sheldon, and S. P. Amarasinghe. A unified framework for schedule and storage optimization. In PLDI '01, pages 232-242, 2001.
19. S. Triantafyllis, M. Vachharajani, and D. I. August. Compiler Optimization-Space Exploration. The Journal of Instruction-level Parallelism (JILP), 2005.
20. R. Whaley and J. Dongarra. Automatically tuned linear algebra software, 1997.
21. M. Wolfe. Iteration space tiling for memory hierarchies. In Proceedings of the Third SIAM Conference on Parallel Processing for Scientific Computing, pages 357-361, 1989.
22. Caps entreprise, http://www.caps-entreprise.com.
23. K. Yotov, X. Li, G. Ren, M. Garzaran, D. Padua, K. Pingali, and P. Stodghill. Is search really necessary to generate high-performance blas, 2005.