METRIC: Memory tracing via dynamic binary rewriting to identify cache inefficiencies

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 2, 2007, Pages

  Marathe, Jaydeep ^a,e   Mueller, Frank ^a,e   Mohan, Tushar ^b   McKee, Sally A ^c,f   De Supinski, Bronis R ^d   Yoo, Andy ^d  

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b IBM INDIA RESEARCH LAB   (India)

^c Department of Obstetrics Gynecology   (United States)

^d LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^e North Carolina State University   (United States)

^f Cornell University   (United States)

Author keywords

Cache analysis; Data trace compression; Data trace generation; Dynamic binary rewriting; Program instrumentation

Indexed keywords

CACHE ANALYSIS; DATA TRACE COMPRESSION; DATA TRACE GENERATION; DYNAMIC BINARY REWRITING; PROGRAM INSTRUMENTATION;

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; HIERARCHICAL SYSTEMS; PROGRAM COMPILERS; STATISTICS;

BUFFER STORAGE;

EID: 34247268507     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1216374.1216380     Document Type: Article

References (42)

1. BALA, V., DUESTERWALD, E., AND BANERJIA, S. 2000. Dynamo: A transparent dynamic optimization system. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1-12.
2. BUCK, B. AND HOLLINGSWORTH, J. 2000a. An API for runtime code patching. Int. J. High Perform. Comput. Appl. 14, 4, 317-329.
3. BUCK, B. AND HOLLINGSWORTH, J. 2000b. Using hardware performance monitors to isolate memory bottlenecks. In Supercomput., 64-65.
4. BURROWS, M. AND WHEELER, D. J. 1994. A block-sorting lossless data compression algorithm. Tech. Rep. 124.
5. BURTSCHER, M. 2004a. Vpc3: A fast and effective trace-compression algorithm. In Proceedings of the BIOMETRICS Conference on Measurement and Modeling of Computer Systems (New York). 167-176.
6. BURTSCHER, M. 2004b. Vpc3 source code, http://www.csl.cornell. edu/burtscher/research/tracecompression/.
7. CHATTERJEE, S., PARKER, E., HANLON, P., AND LEBECK, A. 2001. Exact analysis of the cache behavior of nested loops. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 286-297.
8. CHILIMBI, T. 2001. Efficient representations and abstractions for quantifying and exploiting data reference locality. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 191-202.
9. CHILIMBI, T., DAVIDSON, B., AND LARUS, J. 1999. Cache-Conscious structure definition. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 13-24.
10. CHILIMBI, T., HILL, M., AND LARUS, J. 1999b. Cache-Conscious structure layout. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 1-12.
11. CIPUENTES, C. AND EMMERIK, M. 2000. UQBT: Adaptable binary translation at low cost. Comput. 33, 3 (Mar.), 60-66.
12. DEROSE, L., EKANADHAM, K., HOLLINGSWORTH, J. K., AND SBARAGLIA, S. 2002. SIGMA: A simulator infrastructure to guide memory analysis. In Proceedings of the ACM/IEEE SC Conference.
13. DING, C. AND ZHONG, Y. 2003. Predicting whole-program locality through reuse distance analysis. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
14. GHOSH, S., MARTONOSI, M., AND MALIK, S. 1999. Cache miss equations: A compiler framework for analyzing and tuning memory behavior. ACM Trans. Program. Lang. Syst. 21, 4, 703-746.
15. GRANT, B., PHILIPOSE, M., MOCK, M., CHAMBERS, C., AND EGGERS, S. 1999. An evaluation of staged run-time optimizations in dyc. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 293-304.
16. HAVLAK, P. AND KENNEDY, K. 1991. An implementation of interprocedural bounded regular section analysis. IEEE Trans. Parallel Distrib. Syst. 2, 3 (Jul.), 350-360.
17. HOROWITZ, M., MARTONOSI, M., MOWRY, T., AND SMITH, M. 1996. Informing memory operations: Providing memory performance feedback in modern processors. In Proceedings of the International Symposium on Computer Architecure, 260-270.
18. INTEL. 2004. Intel Itanium2 Processor Reference Manual for Software Development and Optimization Vol.1, Intel, Santa Clara, CA.
19. LARUS, J. AND BALL, T. 1994. Rewriting executable files to measure program behavior. Softw. Pract. Experi. 24, 2 (Feb.), 197-218.
20. LARUS, J. AND SCHNARR, E. 1995. EEL: Machine-Independent executable editing. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 291-300.
21. LEBECK, A. AND WOOD, D. 1994. Cache profiling and the SPEC benchmarks: A case study. Comput. 27, 10 (Oct.), 15-26.
22. LEBECK, A. AND WOOD, D. 1997. Active memory: A new abstraction for memory system simulation. ACM Trans. Model. Comput. Simul. 7, 1 (Jan.), 42-77.
23. MANNING, N. 2005. Sequitur source code, http://sequence.rutgers. edu/sequitur/sequitur.ec.
24. MARATHE, J. AND MUELLER, F. 2002. Detecting memory performance bottlenecks via binary rewriting. In Proceedings of the Workshop on Binary Translation.
25. MARATHE, J., MUELLER, F., AND DE SUPINSKI, B. R. 2005. A hybrid hardware/software approach to efficiently determine cache coherence bottlenecks. In International Conference on Supercomputing, accepted.
26. MARATHE, J., MUELLER, P., MOHAN, T., DE SUPINSKI, B. R., MCKEE, S. A., AND YOO, A. 2003. METRIC: Tracking down inefficiencies in the memory hierarchy via binary rewriting. In Proceedings of the International Symposium on Code Generation and Optimization, 289-300.
27. MARATHE, J., NAGARAJAN, A., AND MUELLER, F. 2004. Detailed cache coherence characterization for OpenMP benchmarks. In Proceedings of the International Conference on Supercomputing, 287-297.
28. MELLOR-CRUMMEY, J., FOWLER, R., AND WHALLEY, D. 2001. Tools for application-oriented performance tuning. In Proceedings of the International Conference on Supercomputing, 154-165.
29. MOHAN, T., DE SUPINSKI, B. R., MCKEE, S. A., MUELLER, F., YOO, A., AND SCHULZ, M. 2003. Identifying and exploiting spatial regularity in data memory references. Supercomput.
30. MOWRY, T. AND LUK, C.-K. 1997. Predicting data cache misses in non-numeric applications through correlation profiling. In MICRO-30, 314-320.
31. MUELLER, P., MOHAN, T., DE SUPINSKI, B. R., MCKEE, S. A., AND YOO, A. 2001. Partial data traces: Efficient generation and representation. In Workshop on Binary Translation. IEEE Technical Committee on Computer Architecture Newsletter.
32. NEVILL-MANNING, C. G. AND WITTEN, I. H. 1997a. Compression and explanation using hierarchical grammars. Comput. J. 40, 2-3.
33. NEVILL-MANNING, C. G. AND WITTEN, I. H. 1997b. Linear-Time, incremental hierarchy inference for compression. In Proceedings of the Data Compression Conference, 3-11.
34. SEWARD, J. 2005. Libbzip2 source code, http://www.bzip.org/ index.html.
35. SITES, R., CHERNOFF, A., KIRK, M., MARKS, M., AND ROBINSON, S. 1993. Binary translation. Commun. ACM 36, 2 (Feb.), 69-81.
36. SRIVASTAVA, A. AND EUSTACE, A. 1994. ATOM: A system for building customized program analysis tools. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 196-205.
37. TENDLER, J. M., DODSON, J. S., FIELDS, JR., J. S., LE, H., AND SINHAROY, B. 2002. POWER4 system microarchitecture. IBM J. Res. Develop. 46, 1 (Jan.), 5-25.
38. UNG, D. AND CIFUENTES, C. 2000. Optimising hot paths in a dynamic binary translator. In Proceedings of the Workshop on Binary Translation.
39. VETTER, J. AND MUELLER, F. 2003. Communication characteristics of large-scale scientific applications for contemporary cluster architectures. J. Parallel Distrib. Comput. 63, 9 (Sept.), 853-865.
40. WEIKLE, D., MCKEE, S. A., SKADRON, K., AND WULF, W. 2000. Caches as filters: A framework for the analysis of caching systems. In Proceedings of the Grace Murray Hopper Conference.
41. WULF, W. 1992. Evaluation of the WM architecture. In Proceedings of the International Symposium on Computer Architecture, 382-390.
42. ZHONG, Y., ORLOVICH, M., SHEN, X., AND DING, C. 2004. Array regrouping and structure splitting using whole-program reference affinity. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.