Program locality analysis using reuse distance

ACM Transactions on Programming Languages and Systems

Volumn 31, Issue 6, 2009, Pages

  Zhong, Yutao ^a   Shen, Xipeng ^b   Ding, Chen ^c  

^a GEORGE MASON UNIVERSITY   (United States)

^b The College of William and Mary   (United States)

^c UNIVERSITY OF ROCHESTER   (United States)

Author keywords

Program locality; Reuse distance; Stack distance; Training based analysis

Indexed keywords

ACCESS PATTERNS; ANALYSIS PROBLEMS; BENCHMARK APPLICATIONS; DATA ACCESS; DISTANCE-BASED; EXACT METHODS; MEMORY PERFORMANCE; MISS-RATE; MODERN COMPUTER SYSTEMS; NETWORK TRAFFIC ANALYSIS; ORDERS OF MAGNITUDE; PARAMETERIZED MODEL; PERFORMANCE MODELING; PREDICTION PROCESS; PROGRAM LOCALITY; PROGRAM OPTIMIZATION; QUANTITATIVE ANALYSIS; REUSE DISTANCE; STACK DISTANCE; STATISTICAL PREDICTION; TEST EXECUTION; TRAINING-BASED ANALYSIS; VIRTUAL MEMORY MANAGEMENT;

BENCHMARKING; CACHE MEMORY; INTERNET; LOCATION; TAXONOMIES;

COMPUTER SOFTWARE REUSABILITY;

EID: 70349743894     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1552309.1552310     Document Type: Article

References (105)

1. Adve,V. and Mellor-Crummey, J. 1998. Using integer sets for data-parallel program analysis and optimization. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
2. Allen,R. and Kennedy, K. 2001. Optimizing Compilers for Modern Architectures: A Dependence- Based Approach. Morgan Kaufmann Publishers.
3. Almasi, G., Cascaval,C., and Padua, D. 2002. Calculating stack distances efficiently. In Proceedings of the ACM SIGPLAN Workshop on Memory System Performance.
4. Almeida, V., Bestavros, A., Crovella, M., and de Oliveira, A. 1996. Characterizing reference locality in the WWW. In Proceedings of the International Conference on Parallel and Distributed Information Systems (PDIS). 92-103.
5. Alon, N., Matias,Y., and Szegedy, M. 1996. The space complexity of approximating the frequency moments. In Proceedings of the ACM Symposium on Theory of Computing.
6. Arnold,M. and Ryder, B. G. 2001. A framework for reducing the cost of instrumented code. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
7. Banerjee, U. 1988. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Boston, MA.
8. Batson,A.P. and Madison, A. W. 1976. Measurements of major locality phases in symbolic reference strings. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems.
9. Bennett,B.T. and Kruskal, V. J. 1975. LRU stack processing. IBM J. Resear. Devel. 353-357.
10. Berg,E. and Hagersten, E. 2004. Statcache: A probabilistic approach to efficient and accurate data locality analysis. In Proceedings of the IEEE International Symposium on Performance Analysis of Systems and Sof tware. 20-27.
11. Berg,E. and Hagersten, E. 2005. Fast data-locality prof iling of native execution. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems. 169-180
12. Beyls,K. and D'Hollander, E. 2002. Reuse distance-based cache hint selection. In Proceedings of the 8th International Euro-Par Conference. Paderborn, Germany. Beyls,K. and D'Hollander, E. 2005. Generating cache hints for improved program efficiency. J. Syst. Archit. 51, 4, 223-250.
13. Beyls,K. and D'Hollander, E. 2006a. Discovery of locality-improving refactoring by reuse path analysis. In Proceedings of the High-Performance Computing and Communications Council. Springer. Lecture Notes in Computer Science, vol.4208. 220-229.
14. Beyls,K. and D'Hollander, E. 2006b. Intermediately executed code is the key to find refactor-ings that improve temporal data locality. In Proceedings of the ACM Conference on Computing Frontiers.
15. Bunt,R.B. and Murphy, J. M. 1984. Measurement of locality and the behaviour of programs. Comput. J. 27, 3, 238-245.
16. Burke,M. and Cytron, R. 1986. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN Symposium on Compiler Construction.
17. Calder, B., Krintz, C., John,S., and Austin, T. 1998. Cache-conscious data placement. In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII).
18. Callahan, D., Cocke,J., and Kennedy, K. 1988a. Analysis of interprocedural side effects in a parallel programming environment. J. Paral. Distrib. Comput. 5, 5, 517-550.
19. Callahan, D., Cocke,J., and Kennedy, K. 1988b. Estimating interlock and improving balance for pipelined machines. J. Paral. Distrib. Comput. 5, 4, 334-358.
20. Carr,S. and Kennedy, K. 1994. Improving the ratio of memory operations to floating-point operations in loops. ACM Trans. Program. Lang. Syst. 16, 6, 1768-1810.
21. Cascaval,C. and Padua, D. A. 2003. Estimating cache misses and locality using stack distances. In Proceedings of the International Conference on Supercomputing. San Francisco, CA.
22. Chandra, D., Guo, F., Kim,S., and Solihin, Y. 2005. Predicting inter-thread cache contention on a chip multi-processor architecture. In Proceedings of the International Symposium on High- Performance Computer Architecture. 340-351.
23. Chatterjee, S., Parker, E., Hanlon,P.J., and Lebeck, A. R. 2001. Exact analysis of the cache behavior of nested loops. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
24. Chen, F., Jiang,S., and Zhang, X. 2005. CLOCK-Pro: An effective improvement of the CLOCK replacement. In Proceedings of the USENIX Annual Technical Conference.
25. Cheng,R. and Ding, C. 2005. Measuring temporal locality variation across program inputs. Tech. rep. TR 875, Department of Computer Science, University of Rochester.
26. Chilimbi, T. M. 2001a. Efficient representations and abstractions for quantifying and exploiting data reference locality. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
27. Chilimbi, T. M. 2001b. On the stability of temporal data reference prof iles. In Proceedings of the International Conference on Parallel Architecture and Compilation Techniques.
28. Chilimbi, T. M., Hill,M.D., and Larus, J. R. 1999. Cache-conscious structure layout. in Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
29. Chilimbi,T.M. and Hirzel, M. 2002. Dynamic hot data stream prefetching for general-purpose programs. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
30. Cierniak,M. and Li, W. 1995. Unifying data and control transformations for distributed shared- memory machines. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation.
31. Cocke,J. and Kennedy, K. 1974. Prof itability computations on program flow graphs. Tech. rep. RC 5123, IBM.
32. Das, R., Uysal, M., Saltz,J., and Hwang, Y.-S. 1994. Communication optimizations for irregular scientific computations on distributed memory architectures. J. Paral. Distrib. Comput. 22,3, 462-479.
33. Datar, M., Gionis, A., Indyk,P., and Motwani, R. 2002. Maintaining stream statistics over sliding windows. SIAM J. Comput. 31, 6, 1794-1813.
34. Denning, P. 1980. Working sets past and present. IEEE Trans. Sof tw. Engin. 6,1.
35. Ding,C. and Kennedy, K. 1999. Improving cache performance in dynamic applications through data and computation reorganization at runtime. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation.
36. Ding,C. and Kennedy, K. 2004. Improving effective bandwidth through compiler enhancement of global cache reuse. J. Paral. Distrib. Comput. 64, 1, 108-134.
37. Ding, C. and Zhong, Y. 2002. Compiler-directed runtime monitoring of program data access. In Proceedings of the ACM SIGPLAN Workshop on Memory System Performance.
38. Eeckhout, L., Vandierendonck, H., and Bosschere, K. D. 2002. Workload design: Selecting representative program-input pairs. In Proceedings of International Conference on Parallel Architectures and Compilation Techniques.
39. Fang, C., Carr, S., Onder,S., and Wang, Z. 2005. Instruction-based memory distance analysis and its application to optimization. In Proceedings of the International Conference on Parallel Architecture and Compilation Techniques.
40. Ferrante, J., Sarkar,V., and Thrash, W. 1991. On estimating and enhancing cache effectiveness. In Proceedings of the 4th International Workshop on Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, Eds. Springer-Verlag.
41. Flajolet,P. and Martin, G. 1983. Probabilistic counting. In Proceedings of the Symposium on Foundations of Computer Science.
42. 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.
43. Gu, X., Christopher, I., Bai, T., Zhang,C., and Ding, C. 2009. A component model of spatial locality. In Proceedings of the International Symposium on Memory Management.
44. Han,H. and Tseng, C.-W. 2006. Exploiting locality for irregular scientific codes. IEEE Trans. Paral. Distrib. Syst. 17, 7, 606-618.
45. Havlak,P. and Kennedy, K. 1991. An implementation of interprocedural bounded regular section analysis. IEEE Trans. Paral. Distrib. Syst. 2, 3, 350-360.
46. Hill,M.D. and Smith, A. J. 1989. Evaluating associativity in CPU caches. IEEE Trans. Com- put. 38, 12, 1612-1630.
47. Hsu, W., Chen, H., Yew, P. C., and Chen, D. 2002. On the predictability of program behavior using different input data sets. In Proceedings of the 6th Workshop on Interaction Between Compilers and Computer Architectures (INTERACT).
48. Jiang,S. and Zhang, X. 2002. LIRS: An efficient low inter-reference recency set replacement to improve buffer cache performance. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems.
49. Jiang, Y., Shen, X., Chen,J., and Tripathi, R. 2008. Analysis and approximation of optimal co- scheduling on chip multiprocessors. In Proceedings of the International Conference on Parallel Architecture and Compilation Techniques. 220-229.
50. Kandemir, M. T. 2005. Improving whole-program locality using intra-procedural and interprocedural transformations. J Paral. Distrib. Comput. 65, 5, 564-582.
51. Kelly, T., Cohen, I., Goldszmidt, M., and Keeton, K. 2004. Inducing models of black-box storage arrays. Tech. rep. HPL-2004-2108, HP Laboratories Palo Alto, CA.
52. Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman,T., and Wonnacott, D. 1996. The Omega Library Interface Guide. Tech. rep., Department of Computer Science, University of Maryland, College Park.
53. Kelsey, K., Bai,T., and Ding, C. 2009. Fast track: A sof tware system for speculative optimization. In Proceedings of the International Symposium on Code Generation and Optimization.
54. Kim, Y. H., Hill,M.D., and Wood, D. A. 1991. Implementing stack simulation for highly- associative memories. In Proceedings of the ACM SIGMETRICS Conference on Measurement and Modeling of Computer Systems. 212-213.
55. KleinOsowski,A. and Lilja, D. J. 2002. MinneSPEC: A new SPEC benchmark workload for simulation-based computer architecture research. Comput. Archit. Lett. 1.
56. Knobe,K. and Sarkar, V. 1998. Array SSA form and its use in parallelization. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
57. Knuth, D. 1971. An empirical study of FORTRAN programs. Sof tw. Pract. Exper. 1, 105-133.
58. Kodukula, I., Ahmed,N., and Pingali, K. 1997. Data-centric multi-level blocking. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation.
59. Li, Z., Yew, P., and Zhu, C. 1990. An efficient data dependence analysis for parallelizing compilers. IEEE Trans. Paral. Distrib. Syst. 1, 1, 26-34.
60. Liu, J., Chen, H., Yew, P.-C., and Hsu, W.-C. 2004. Design and implementation of a lightweight dynamic optimization system. J Instruct.-Level Paral. 6.
61. Marin,G. and Mellor-Crummey, J. 2004. Cross architecture performance predictions for scientific applications using parameterized models. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems.
62. Marin,G. and Mellor-Crummey, J. 2005. Scalable cross-architecture predictions of memory hierarchy response for scientific applications. In Proceedings of the Symposium of the Las Alamos Computer Science Institute.
63. Mattson, R. L., Gecsei, J., Slutz,D., and Traiger, I. L. 1970. Evaluation techniques for storage hierarchies. IBMSyst. J. 9, 2, 78-117.
64. McKinley, K.S., Carr,S., and Tseng, C.-W. 1996. Improving data locality with loop transformations. ACM Trans. Program. Lang. Syst. 18, 4, 424-453.
65. Mellor-Crummey, J., Whalley,D., and Kennedy, K. 2001. Improving memory hierarchy performance for irregular applications. Int. J. Paral. Program. 29,3.
66. Olken, F. 1981. Efficient methods for calculating the success function of fixed space replacement policies. Tech. rep. LBL-12370, Lawrence Berkeley Laboratory.
67. Petrank, E. and Rawitz, D. 2002. The hardness of cache conscious data placement. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
68. Porterfield, A. 1989. Sof tware methods for improvement of cache performance. Ph.D. thesis, Department of Computer Science, Rice University.
69. Rawlings, J. O. 1988. Applied Regression Analysis: A Research Tool. Wadsworth and Brooks.
70. Rothberg, E., Singh,J. P., and Gupta, A. 1993. Working sets, cache sizes, and node granularity issues for large-scale multiprocessors. In Proceedings of the International Symposium on Computer Architecture. 14-25.
71. Seidl,M.L. and Zorn, B. G. 1998. Segregating heap objects by reference behavior and lifetime. in Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems.
72. Shen, X., Gao, Y., Ding,C., and Archambault, R. 2005. Lightweight reference affinity analysis. In Proceedings of the 19th ACM International Conference on Super-Computing. 131-140.
73. Shen, X., Shaw, J., Meeker,B., and Ding, C. 2007. Locality approximation using time. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. 55-61.
74. Shen, X., Zhang, C., Ding, C., Scott, M., Dwarkadas,S., and Ogihara, M. 2007. Analysis of input- dependent program behavior using active prof iling. In Proceedings of The 1st Workshop on Experimental Computer Science.
75. Shen, X., Zhong,Y., and Ding, C. 2004a. Locality phase prediction. In Proceedings of the International Conference on Architectual Support for Programming Languages and Operating Systems. 165-176.
76. Shen, X., Zhong,Y., and Ding, C. 2004b. Phase-based miss rate prediction. In Proceedings of the International Workshop on Languages and Compilers for Parallel Computing.
77. Shen, X., Zhong,Y., and Ding, C. 2007. Predicting locality phases for dynamic memory optimization. J. Paral. Distrib. Comput. 67, 7, 783-796.
78. Sleator,D.D. and Tarjan, R. E. 1985. Self adjusting binary search trees. J. ACM 32,3.
79. Smaragdakis, Y., Kaplan,S., and Wilson, P. 2003. The EELRU adaptive replacement algorithm. Perform. Eval. 53, 2, 93-123.
80. Smith, A. J. 1976. On the effectiveness of set associative page mapping and its applications in main memory management. In Proceedings of the 2nd International Conference on Sof tware Engineering.
81. So, B., Hall,M.W., and Diniz, P. C. 2002. A compiler approach to fast hardware design space exploration in FPGA-based systems. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
82. Song,Y. and Li, Z. 1999. New tiling techniques to improve cache temporal locality. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
83. 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.
84. Strout, M. M., Carter, L., and Ferrante, J. 2003. Compile-time composition of runtime data and iteration reorderings. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. 245-257.
85. Sugumar,R.A. and Abraham, S. G. 1993. Multi-configuration simulation algorithms for the evaluation of computer architecture designs. Tech. rep., University of Michigan.
86. Suh, G. E., Devadas,S., and Rudolph, L. 2001. Analytical cache models with applications to cache partitioning. In Proceedings of the International Conference on Super-Computing. 1-12.
87. Thabit, K. O. 1981. Cache management by the compiler. Ph.D. thesis, Department of Computer Science, Rice University.
88. Thompson,J.G. and Smith, A. J. 1989. Efficient (stack) algorithms for analysis of write-back and sector memories. ACM Trans. Comput. Syst. 7, 1, 78-117.
89. Triolet, R., Irigoin,F., and Feautrier, P. 1986. Direct parallelization of CALL statements. In Proceedings of the SIGPLAN Symposium on Compiler Construction.
90. Wall, D. W. 1991. Predicting program behavior using real or estimated prof iles. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
91. Wang,W. and Baer, J.-L. 1991. Efficient trace-driven simulation methods for cache performance analysis. ACM Trans. Comput. Syst. 9,3.
92. Wolf,M.E. and Lam, M. 1991. A data locality optimizing algorithm. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation.
93. Wolfe, M. J. 1996. High-Performance Compilers for Parallel Computing. Addison-Wesley, Redwood City, CA.
94. Wonnacott, D. 2002. Achieving scalable locality with time skewing. Int. J. Paral. Program. 30,3.
95. Xue, J. and Vera, X. 2004. Efficient and accurate analytical modeling of whole-program data cache behavior. IEEE Trans. Comput. 53,5.
96. Yang, T., Berger,E. D., Kaplan,S. F., and Moss, J. E. B. 2006. Cramm: Virtual memory support for garbage-collected applications. In Proceedings of the Symposium on Operating Systems Design and Implementation. 103-116.
97. Yi, Q., Adve,V., and Kennedy, K. 2000. Transforming loops to recursion for multi-level memory hierarchies. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
98. Zhang, C., Ding, C., Ogihara, M., Zhong,Y., and Wu, Y. 2006. A hierarchical model of data locality. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
99. Zhao, P., Cui, S., Gao, Y., Silvera, R., and Amaral, J. N. 2007. Forma: A framework for safe automatic array reshaping. ACM Trans. Program. Lang. Syst. 30,1,2.
100. Zhong,Y. and Chang, W. 2008. Sampling-based program locality approximation. In Proceedings of the International Symposium on Memory Management. 91-100.
101. Zhong, Y., Ding,C., and Kennedy, K. 2002. Reuse distance analysis for scientific programs. in Proceedings of Workshop on Languages, Compilers, and Runtime Systems for Scalable Computers.
102. Zhong, Y., Dropsho, S. G., Shen, X., Studer, A., and Ding, C. 2007. Miss rate prediction across program inputs and cache configurations. IEEE Trans. Comput. 56, 3, 328-343.
103. 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.
104. Zhou, P., Pandey, V., Sundaresan, J., Raghuraman, A., Zhou,Y., and Kumar, S. 2004. Dynamic tracking of page miss ratio curve for memory management. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems.
105. Zhou, Y., Chen,P.M., and Li, K. 2001. The multi-queue replacement algorithm for second-level buffer caches. In Proceedings of the USENIX Technical Conference.