Optimizing program locality through CMEs and GAs

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn 2003-January, Issue , 2003, Pages 68-78

  Vera, X ^a   Abella, J ^b   Gonzalez A ^b   Llosa, J ^b  

^a MÄLARDALEN UNIVERSITY   (Sweden)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BRIDGES; GENETIC ALGORITHMS; MEMORY ARCHITECTURE; METADATA; PARALLEL ARCHITECTURES;

BRANCH PREDICTORS; CACHE MISS EQUATIONS; DATA TRANSFORMATION; HARDWARE COMPONENTS; LOOP TRANSFORMATION; MEMORY HIERARCHY; OPTIMIZING PROGRAMS; REDUCING CAPACITY;

CACHE MEMORY;

EID: 84857557751     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2003.1238003     Document Type: Conference Paper

References (38)

1. J. Abella, A. González, J. Llosa, and X. Vera. Near-optimal loop tiling by means of cache miss equations and genetic algorithms. Technical Report UPC-DAC-2001-20, Universitat Politècnica de Catalunya, June 2001.
2. N. Bermudo, X. Vera, A. González, and J. Llosa. An efficient solver for cache miss equations. In Proceedings of IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS'00), 2000.
3. M. Butler, T.-Y. Yeh, Y. Patt, M. Alsup, H. Sales, and M. Shebanow. Instruction level parallelism is greater than two. In Proceedings of the 18th International Symposium on Computer Architecture (ISCA'91), pages 276-286, 1991.
4. S. Carr and K. Kennedy. Compiler blockability of numerical algorithms. In Proceedings of Supercomputing (SC'92), pages 114-124, Nov. 1992.
5. S. Carr, K. McKinley, and C.-W. Tseng. Compiler optimizations for improving data locality. In Proceedings of VI Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS'94), pages 252-262, Oct. 1994.
6. S. Chatterjee, V. V. Jain, A. R. Lebeck, S. Mundhra, and M. Thottethodi. Nonlinear array layout for hierarchical memory systems. In Proceedings of ACM International Conference on Supercomputing (ICS'99), pages 444-453, Rhodes, Greece, Jun. 1999.
7. S. Coleman and K. S. McKinley. Tile size selection using cache organization and data layout. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95), pages 279-290, Jun. 1995.
8. K. D. Cooper, P. J. Schielke, and D. Subramanian. Optimizing for reduced code space using genetic algorithms. In Proceedings of the ACM SIGPLAN 1999 workshop on Languages, compilers, and tools for embedded systems, pages 1-9. ACM Press, 1999.
9. D. Gannon, W. Jalby, and K. Gallivan. Strategies for cache and local memory management by global program transformations. Journal of Parallel and Distributed Computing, 5:587-616, 1988.
10. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems, 21(4):703-746, 1999.
11. Gill, Murray, and Wright. Practical optimization. Academic Press, 1981.
12. Glover and Laguna. Tabu search. Kluwer, 1997.
13. D. Goldberg. Genetic algorithms in search, optimizations and machine learning. Addison-Wesley, 1989.
14. Hansen, Jaumard, and Mathon. Constrained nonlinear 0-1 programming. ORSA Journal on Computing, 1995.
15. J. Holland. Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, 1975.
16. R. Horst, P. M. Pardalos, and N. V. Thoai. Introduction to Global Optimization. Kluwer Academic Publishers, 1995.
17. M. Kandemir, A. Choudhary, P. Banerjee, and J. Ramanujam. A linear algebra framework for automatic determination of optimal data layouts. IEEE Transactions on Parallel and Distributed Systems, 10(2):115-135, Feb. 1999.
18. Kirkpatrick, Gelatt, and Vecchi. Optimization by simulated annealing. Science 220, 1983.
19. P. Kulkarni, W. Zhao, H. Moon, K. Cho, D. Whalley, J. Davidson, M. Bailey, Y. Paek, and K. Gallivan. Finding effective optimization phase sequences. In Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems, pages 12-23. ACM Press, 2003.
20. M. Lam, E. E. Rothberg, and M. E. Wolf. The cache performance of blocked algorithms. In Proceedings of IV International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'91), Apr. 1991.
21. K. McKinley, S. Carr, and C.-W. Tseng. Improving data locality with loop transformations. ACM Transactions on Programming Languages and Systems, 18(4):424-453, Jul. 1996.
22. K. S. McKinley and O. Temam. A quantitative analysis of loop nest locality. In Proceedings of VII Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS'96), 1996.
23. T. Mowry, M. Lam, and A. Gupta. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of V Int. Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS'92), pages 62-73, Oct. 1992.
24. E. Petrank and D. Rawitz. Hardness of cache conscious data placement. In Proceedings of International Conference on Principles of Programming Languages (POPL'02), 2002.
25. G. Rivera and C.-W. Tseng. Data transformations for eliminating conflict misses. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98), pages 38-49, 1998.
26. G. Rivera and C.-W. Tseng. Eliminating conflict misses for high performance architectures. In Proceedings of ACM Internacional Conference on Supercomputing (ICS'98), 1998.
27. G. Rivera and C.-W. Tseng. A comparison of compiler tiling algorithms. In Proceedings of the 8th International Conference on Compiler Construction (CC'99), 1999.
28. G. Rivera and C.-W. Tseng. Locality optimizations for multi-level caches. In Proceedings of Supercomputing (SC'99), 1999.
29. V. Sarkar and N. Meggido. An analytical model for loop tiling and its solution. In Proceedings of IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS'00), 2000.
30. O. Temam, E. Granston, and W. Jalby. To copy or not to copy: A compile-time technique for accessing when data copying should be used to eliminate cache conflicts. In Proceedings of Supercomputing (SC'93), pages 410-419, 1993.
31. Torn and Zilinskas. Global optimization. Springer-Verlag, 1989.
32. X. Vera, J. Llosa, and A. González. Near-optimal padding for removing conflict misses. Technical Report UPC-DAC-2000-71, Universitat Politècnica de Catalunya, Nov. 2000.
33. X. Vera, J. Llosa, A. González, and N. Bermudo. A fast and accurate approach to analyze cache memory behavior. In Proceedings of European Conference on Parallel Computing (Europar'00), 2000.
34. X. Vera and J. Xue. Let?s study whole program cache behaviour analytically. In Proceedings of International Symposium on High-Performance Computer Architecture (HPCA 8), Cambridge, Feb. 2002.
35. M. Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'91), pages 30-44, Jun. 1991.
36. M. Wolfe. Advanced loop interchanging. In Proceedings of International Conference on Parallel Processing (ICPP'96), 1996.
37. J. Xue. On tiling as a loop transformation. Parallel Processing Letters, 7(4):409-424, 1997.
38. J. Xue and C.-H. Huang. Reuse-driven tiling for data locality. International Journal of Parallel Programming, 26(6):671-696, 1998.