Automated locality optimization based on the reuse distance of string operations

Proceedings - International Symposium on Code Generation and Optimization, CGO 2011

Volumn , Issue , 2011, Pages 181-190

  Rus, Silvius ^a   Ashok, Raksit ^b   Li, David Xinliang ^a  

^a GOOGLE INC   (United States)

^b Google Inc   (Japan)

Author keywords

memcpy; nontemporal; reuse distance

Indexed keywords

CACHE POLLUTION; CONTEXT SENSITIVE; FEEDBACK DIRECTED OPTIMIZATIONS; LOCALITY OPTIMIZATION; MEMCPY; MEMORY ACCESS; NONTEMPORAL; NOVEL SOLUTIONS; PROCESSOR CACHE; PROTECTION MECHANISMS; REUSE DISTANCE; RUN-TIME LIBRARY; STATIC CODES;

CACHE MEMORY; NETWORK COMPONENTS; OPTIMIZATION; PROGRAM COMPILERS;

COMPUTER SOFTWARE REUSABILITY;

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

References (17)

1. AMD family 10h. http://en.wikipedia.org/wiki/AMD-K10.
2. The gcc compiler collection. http://gcc.gnu.org.
3. Intel Core processors. http://en.wikipedia.org/wiki/Intel-Core-2.
4. Intel Nehalem. http://en.wikipedia.org/wiki/Nehalem-(microarchitecture).
5. K. Beyls and E. H. D'Hollander. Reuse distance-based cache hint selection. In Euro-Par '02: Proceedings of the 8th International Euro-Par Conference on Parallel Processing, pages 265-274, London, UK, 2002. Springer-Verlag.
6. K. Beyls and E. H. D'Hollander. Generating cache hints for improved program efficiency. J. Syst. Archit., 51(4):223-250, 2005. (Pubitemid 40371114)
7. A. Chauhan and C.-Y. Shei. Static reuse distances for locality-based optimizations in matlab. In ICS '10: Proceedings of the 24th ACM International Conference on Supercomputing, pages 295-304, New York, NY, USA, 2010. ACM.
8. C.-H. Chi and H. Dietz. Unified management of registers and cache using liveness and cache bypass. SIGPLAN Not., 24(7):344-353, 1989.
9. T. M. Chilimbi. On the stability of temporal data reference profiles. In PACT '01: Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques, page 151, Washington, DC, USA, 2001. IEEE Computer Society.
10. C. Fang, S. Carr, S. Önder, and Z. Wang. Feedback-directed memory disambiguation through store distance analysis. In ICS '06: Proceedings of the 20th annual international conference on Supercomputing, pages 278-287, New York, NY, USA, 2006. ACM.
11. J. Gecsei, D. R. Slutz, and I. L. Traiger. Evaluation techniques for storage hierarchies. IBM Syst. J., 9(2):78-117, 1970.
12. X. Gu, I. Christopher, T. Bai, C. Zhang, and C. Ding. A component model of spatial locality. In ISMM '09: Proceedings of the 2009 international symposium on Memory management, pages 99-108, New York, NY, USA, 2009. ACM.
13. P. Petoumenos, G. Keramidas, and S. Kaxiras. Instruction-based reuse-distance prediction for effective cache management. In SAMOS'09: Proceedings of the 9th international conference on Systems, architectures, modeling and simulation, pages 49-58, Piscataway, NJ, USA, 2009. IEEE Press.
14. X. Shen, J. Shaw, B. Meeker, and C. Ding. Locality approximation using time. In POPL '07: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 55-61, New York, NY, USA, 2007. ACM.
15. G. Tyson, M. Farrens, J. Matthews, and A. R. Pleszkun. A modified approach to data cache management. In MICRO 28: Proceedings of the 28th annual international symposium on Microarchitecture, pages 93-103, Los Alamitos, CA, USA, 1995. IEEE Computer Society Press.
16. H. Yang, R. Govindarajan, G. R. Gao, and Z. Hu. Compiler-assisted cache replacement: Problem formulation and performance evaluation. In 16th International Workshop on Languages and Compilers for Parallel Computing(LCPC03), pages 131-139, 2003.
17. Y. Zhong, X. Shen, and C. Ding. Program locality analysis using reuse distance. ACM Trans. Program. Lang. Syst., 31(6):1-39, 2009.