Sampling-based program locality approximation

International Symposium on Memory Management, ISMM

Volumn , Issue , 2008, Pages 91-100

  Zhong, Yutao ^a   Chang, Wentao ^a  

^a George Mason University

Author keywords

Profiling; Program locality; Reuse distance; Reuse signature; Sampling

Indexed keywords

ACCURATE MODELS; INSTRUMENTATION TOOLS; MEASUREMENT ACCURACIES; PRACTICAL USES; PROFILING; PROGRAM ANALYSIS; PROGRAM LOCALITY; PROGRAM MEMORIES; REUSE DISTANCE; REUSE DISTANCES; REUSE SIGNATURE; SAMPLING METHODS; SAMPLING STRATEGIES; SPEED-UP; SYSTEMATIC SAMPLINGS; UNIFORM COVERAGES;

DATA STORAGE EQUIPMENT; OPTIMIZATION;

COMPUTER SOFTWARE REUSABILITY;

EID: 57349160281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375634.1375648     Document Type: Conference Paper

References (36)

1. Intel vtune performance analyzers. http://www.intel.com/software/ products/vtune.
2. ALBONESI, D. H. Selective cache ways: On-demand cache resource allocation. In Proceedings of the 32nd annual ACM/IEEE international Symposium on Microarchitecture (1999).
3. ALMASI. G., CASCAVAL, C., AND PADUA, D. Calculating stack distances efficiently. In Proceedings of the first ACM SIGPLAN Workshop on Memory System Performance (Berlin, Germany, 2002).
4. ANDERSON, J. M., BERC, L. M., DEAN, J., GHEMAWAT, S., HENZINGER, M. R., LEUNO, S. A., SITES, R. L., VANDEVOORDE, M. T., WALDSPURGER, C. A., AND WEIHL, W. E. Continuous profiling: Where have all the cycles gone? In SOSP '97: Proceedings of the sixteenth ACM symposium on Operating systems principles (New York, NY, USA, 1997), ACM Press, pp. 1-14.
5. ARNOLD, M., AND GROVE, D. Collecting and exploiting high-accuracy call graph profiles in virtual machines. In Proceedings of the International Symposium on Code Generation and Optimization (CGO '05) (2005).
6. ARNOLD, M., AND RYDER, B. G. Aframework for reducing the cost of instrumented code. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (Snowbird, Utah, June 2001).
7. ARNOLD, M., AND SWEENEY, P. F. Approximating the calling context tree via sampling. Tech. rep., IBM Research, 2000.
8. BALASUBRAMONIAN, R., ALBONESI, D., BUYUKTOS, A., AND DWARKADAS, S. Dynamic memory hierarchy performance and energy optimization. In Proceedings of the 27th Annual International Symposium on Computer Architecture (June 2000).
9. BENNETT, B., AND KRUSKAL, V. J. LRU stack processing. IBM Journal of Research and Development (July 1975), 353-357.
10. BEYLS, K., AND D'HOLLANDER, E. Reuse distance as a metric for cache behavior. In Proceedings of the IASTED Conference on Parallel and Distributed Computing and Systems (August 2001).
11. BEYLS, K., AND D'HOLLANDER, E. Reuse distance-based cache hint selection. In Proceedings of the 8th International Euro-Par Conference (Paderborn, Germany, August 2002).
12. BURROWS, M., ERLINOSON, U., LEUNG, S.-T., VANDEVOORDE, M. T., WALDSPURGER, C. A., WALKER, K., AND WEIHL, W. E. Efficient and flexible value sampling. In Architectural Support for Programming Languages and Operating Systems (2000).
13. CHILIMBI, T. M., AND HIRZEL, M. Dynamic hot data stream prefetching for general-purpose programs. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation (Berlin, Germany, June 2002).
14. DING, C. Improving Effective Bandwidth through Compiler Enhancement of Global and Dynamic Cache Reuse. PhD thesis, Dept. of Computer Science, Rice University, January 2000.
15. DING, C., AND ZHONG, Y. Compiler-directed run-time monitoring of program data access. In Proceedings of the first ACM SIGPLAN Workshop on Memory System Performance (Berlin, Germany, 2002).
16. DING, C., AND ZHONG, Y. Predicting whole-program locality with reuse distance analysis. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and. Implementation (San Diego, CA, June 2003).
17. FANG, C., CARR, S., ONDER, S., AND WANG, Z. Reuse-distance-based miss-rate prediction on a per instruction basis. In Proceedings of the first ACM SIGPLAN Workshop on Memory System Performance (Washington DC, June 2004).
18. FANG, C., CARR, S., ONDER, S., AND WANG, Z. Instruction based memory distance analysis and its application to optimization. In Proceedings of International Conference on Parallel Architectures and Compilation Techniques (St. Louis, MO, 2005).
19. HIRZEL, M., AND CHILIMBI, T. M. Bursty tracing: A framework for low-overhead temporal profiling. In Proceedings of ACM Workshop on Feedback-Directed and Dynamic Optimization (Dallas, Texas, December 2001).
20. HUANG, S. A., AND SHEN, J. P. The intrinsic bandwidth requirements of ordinary programs. In Proceedings of the 7th International Conferences on Architectural Support for Programming Languages and Operating Systems (Cambridge, MA, October 1996).
21. ITZKOWITZ, M., WYLIE, B. J. N., AOKI, C., AND KOSCHE, N. Memory profiling using hardware counters. In Proceedings of the ACM/IEEE conference on Supercomputing (Washington, DC, 2003).
22. KIM, Y. H., HILL, M. D., AND WOOD, D. A. Implementing stack simulation for highly-associative memories. In Proc. ACM SIG-METRICS Conference on Measurement and Modeling of Computer Systems (May 1991), pp. 212-213.
23. LARUS, J. R. Abstract execution: A technique for efficiently tracing programs. Software - Practice and Experience (SPE) 20, 12 (1990).
24. LI, Z., GU, J., AND LEE, G. An evaluation of the potential benefits of register allocation for array references. In Workshop on Interaction between Compilers and Computer Architectures in conjunction with the HPCA-2 (San Jose, CA, February 1996).
25. MARIN, G., AND MELLOR-CRUMMEY, J. Cross architecture performance predictions for scientific applications using parameterized models. In Proceedings of Joint International Conference on Measurement and Modeling of Computer Systems (New York City, NY, June 2004).
26. MATTSON, R. L., GECSEI, J., SLUTZ, D., AND TRAIGER, I. Evaluation techniques for storage hierarchies. IBM System Journal 9, 2(1970), 78-117.
27. NETHERCOTE, N., AND SEWARD, J. Valgrind: a framework for heavyweight dynamic binary instrumentation. In Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (New York, NY, USA, 2007).
28. OLKEN, F. Efficient methods for calculating the success function of fixed space replacement policies. Tech. Rep. LBL-12370, Lawrence Berkeley Laboratory, 1981.
29. SHEN, X., SHAW, J., MEEKER, B., AND DING, C. Locality approximation using time. In Proceedings of 2007 Symposium on Principles of Programming Languages (Nice, France, January 2007).
30. SHEN, X., ZHONG, Y., AND DING, C. Locality phase prediction. In Proceedings of the Eleventh International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOSXI) (Boston, MA, 2004).
31. SUGUMAR, R. A., AND ABRAHAM, S. G. Multi-configuration simulation algorithms for the evaluation of computer architecture designs. Tech. rep., University of Michigan, August 1993.
32. WHALEY, J. A portable sampling-based profiler for Java virtual machines. In ACM 2000 Java Grande Conference (2000), pp. 78-87.
33. ZAGHA, M., LARSON, B., TURNER, S., AND ITZKOWITZ, M. Performance analysis using the mips r10000 performance counters. In Proceedings of the 1996 ACM/IEEE Conference on Supercomputing (November 1996).
34. ZHAO, Q., RABBAH, R., AMARASINGHE, S., RUDOLPH, L., AND WONG, W.-F. Ubiquitous memory introspection. In Proceedings of International Symposium on Code Generation and Optimization (CGO'07) (2007).
35. ZHONG, Y, DROPSHO, S. G., SHEN, X., STUDER, A., AND DING, C. Miss rate prediction across program inputs and cache configurations. IEEE Transactions on Computers 56, 3 (March 2007), 328-343.
36. ZHONG, Y., ORLOVICH, M., SHEN, X., AND DING, C. Array regrouping and structure splitting using whole-program reference affinity. In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation (Washington, DC, June 2004).