An accurate cost model for guiding data locality transformations

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 5, 2005, Pages 946-987

  Vera, Xavier ^a,c   Abella, Jaume ^b   Llosa, Josep ^a,b   González, Antonio ^a,b  

^a MÄLARDALEN UNIVERSITY   (Sweden)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c Institutionen för Datateknik Mälardalens Högskola   (Sweden)

Author keywords

Cache memories; Genetic algorithms; Padding; Tiling

Indexed keywords

COST MODEL; DATA LOCALITY; PADDING; TILING;

CACHE MEMORY; COSTS; DATA REDUCTION; GENETIC ALGORITHMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; PROGRAM PROCESSORS;

DATA TRANSFER;

EID: 33745423635     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1086642.1086646     Document Type: Article

References (41)

1. BANERJEE, U. 1988. Dependence Analysis for Supercomputing. Kluwer Academic Publishers.
2. BELADY, L. A. 1966. A study of replacement algorithms for a virtual-storage computer. IBM Syst. J.
3. BERMUDO, N., VERA, X., GONZALEZ, A., AND LLOSA, J. 2000. An efficient solver for cache miss equations. In Proceedings of IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS'00). IEEE Computer Society Press, Los Alamitos, CA.
4. BUTLER, M., YEH, T.-Y., PATT, Y., ALSUP, M., SALES, H., AND SHEBANOW, M. 1991. Instruction level parallelism is greater than two. In Proceedings of the 18th International Symposium on Computer Architecture (ISCA91). 276-286.
5. CARR, S. AND KENNEDY, K. 1992. Compiler blockability of numerical algorithms. In Proceedings of Supercomputing (SC'92). 114-124.
6. CARH, S., MCKINLEY, K., AND TSENG, C.-W. 1994. Compiler optimizations for improving data locality. In Proceedings of VI International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'94). 252-262.
7. CHATTERJEE, S., JAIN, V. V., LEBECK, A. R., MUNDHRA, S., AND THOTTETHODI, M. 1999. Nonlinear array layout for hierarchical memory systems. In Proceedings of ACM International Conference on Supercomputing (ICS'99) (Rhodes, Greece). ACM, New York, 444-453.
8. CLAUSE, P. 1996. Counting solutions to linear and non-linear constraints through Ehrhart polynomials. In Proceedings of ACM International Conference on Supercomputing (ICS'96) (Philadelphia, PA). ACM, New York, 278-285.
9. COLEMAN, S. AND MCKINLEY, K. S. 1995. Tile size selection using cache organization and data layout. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'95). ACM, New York, 279-290.
10. DYER, M. AND FRIEZE, A. M. 1988. On the complexity of computing the volumne of a polyhedron. SIAM J. Comput. 17, 5, 967-974.
11. ERMOLIEV, Y. AND WETS, R. J.-B. 1988. Numerical Techniques for Stochastic Optimization. Springer-Verlag, New York.
12. FERNÁNDEZ, A. 1999. A quantitative analysis of the SPECfp95. Tech. Rep. UPC-DAC-1999-12, Universitat Politècnica de Catalunya. March.
13. GANNON, D., JALBY, W., AND GALLIVAN, K. 1988. Strategies for cache and local memory management by global program transformations. J. Paral. Distrib. Comput. 5, 587-616.
14. GHOSH, S., MARTONOSI, M., AND MALIK, S. 1999. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Trans. Prog. Lang. Syst. (TOPLAS) 21, 4, 703-746.
15. GILL, P. E., MURRAY, W., AND WRIGHT, M. H. 1981. Practical optimization. Academic Press, Orlando, FL.
16. GLOVER, P. AND LAGUNA, M. 1997. Tabu search. Kluwer.
17. GOLDBERG, D. E. 1989. Genetic algorithms in search, optimizations and machine learning. Addison-Wesley, Reading, MA.
18. HANSEN, P., JAUMARD, B., AND MATHON, V. 1995. Constrained nonlinear 0-1 programming. ORSA J. Comput.
19. HOLLAND, J. 1975. Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, MI.
20. HORST, R., PARDALOS, P. M., AND THOAI, N. V. 1995. Introduction to Global Optimization. Kluwer Academic Publishers.
21. KANDEMIR, M., CHOUDHARY, A., BANERJEE, P., AND RAMANUJAM, J. 1999. A linear algebra framework for automatic determination of optimal data layouts. IEEE Trans. Paral. Distrib. Syst. 10, 2 (Feb.), 115-135.
22. KIRKPATRICK, S., GELATT, C. D., AND VECCHI, M. P. 1983. Optimization by simulated annealing. Science 220.
23. LAM, M., ROTHBERG, E. E., AND WOLF, M. E. 1991. The cache performance of blocked algorithms. In Proceedings of IV International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'91).
24. MCFARLING, S. 1993. Combining branch predictors. Tech. Rep. TN-36, Digital Western Researh Lab.
25. MCKINLEY, K., CARR, S., AND TSENG, C.-W. 1996. Improving data locality with loop transformations. ACM Trans. Prog. Lang. Syst. (TOPLAS) 18, 4 (Jul.), 424-453.
26. MCKINLEY, K. S. AND TEMAM, O. 1996. A quantitative analysis of loop nest locality. In Proceedings of VII International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'96).
27. MICHALEWICZ, Z. 1994. Genetic algorithms+Data structures=Evolution Programs. Springer-Verlag, New York.
28. MOWEY, T., LAM, M., AND GUPTA, A. 1992. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of V International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'92). 62-73.
29. PETRANK, E. AND RAWITZ, D. 2002. Hardness of cache conscious data placement. In Proceedings of International Conference on Principles of Programming Languages (POPL'02).
30. RIVERA, G. AND TSENG, C.-W. 1998a. Data transformations for eliminating conflict misses. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98). ACM, New York, 38-49.
31. RIVERA, G. AND TSENG, C.-W. 1998b. Eliminating conflict misses for high-performance architectures. In Proceedings of ACM International Conference on Supercomputing (ICS'98). ACM, New York.
32. RIVERA, G. AND TSENG, C.-W. 1999a. A comparison of compiler tiling algorithms. In Proceedings of the 8th International Conference on Compiler Construction (CC'99).
33. RIVERA, G. AND TSENG, C.-W. 1999b. Locality optimizations for multi-level caches. In Proceedings of Supercomputing (SC'99).
34. SHARANGPANI, H. 2000. Itanium microprocessor architecture. IEEE Micro.
35. TEMAM, O., GRANSTON, E., AND JALBY, W. 1993. 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). 410-419.
36. TORN, A. AND ZILINSKAS, A. 1989. Global optimization. Springer-Verlag, New York.
37. VAVASIS, S. A. 1991. Nonlinear Optimization, Complexity Issues. Oxford University Press.
38. VERA, X., BERMUDO, N., LLOSA, J., AND GONZÁLEZ, A. 2004. A fast and accurate framework to analyze and optimize cache memory behavior. ACM Trans. Prog. Lang. Syst. (TOPLAS) 26, 2, 263-300.
39. VERA, X., LLOSA, J., GONZALEZ, A., AND BERMUDO, N. 2000. A fast and accurate approach to analyze cache memory behavior. In Proceedings of European Conference on Parallel Computing (Europar'00).
40. WOLF, M. AND LAM, M. 1991. A data locality optimizing algorithm. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'91). ACM, New York, 30-44.
41. WOLFE, M. 1996. Advanced loop interchanging. In Proceedings of International Conference on Parallel Processing (ICPP'96).