Efficient and accurate analytical modeling of whole-program data cache behavior

IEEE Transactions on Computers

Volumn 53, Issue 5, 2004, Pages 547-566

  Xue, Jingling ^a   Vera, Xavier ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

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

Author keywords

Analytical modeling; Cache memories; Data locality; Modeling techniques; Performance evaluation

Indexed keywords

COMPUTER HARDWARE; COMPUTER SIMULATION; HEURISTIC METHODS; OPTIMIZATION; PROGRAM COMPILERS; SAMPLING;

ANALYTICAL MODELING; DATA CACHE; DATA LOCALITY; PERFORMANCE EVALUATION;

BUFFER STORAGE;

EID: 3042664555     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2004.1275296     Document Type: Article

References (60)

1. G. Aigner and U. Hölzle, "Eliminating Virtual Function Calls in C++ Programs," Proc. 10th European Conf. Object-Oriented Programming (ECOOP '96), pp. 142-166, 1996.
2. G. Ammons, T. Ball, and J. Larus, "Exploiting Hardware Performance Counters with Flow and Context Sensitive Profiling," Proc. ACM SIGPLAN '97 Conf. Programming Language Design and Implementation (PLDI '97), pp. 85-96, 1997.
3. E. Ayguadé, C. Barrado, A. González, J. Labarta, J. Llosa, D. López, S. Moreno, D. Padua, F. Reig, Q. Riera, and M. Valero, "Ictineo: A Tool for Research on ILP," Proc. Supercomputing '96, 1996.
4. D. F. Bacon, J.-H. Chow, D.-C.R. Ju, K. Muthukumar, and V. Sarkar, "A Compiler Framework for Restructuring Data Declarations to Enhance Cache and TLB Effectiveness," Proc. IBM Centers for Advanced Studies Conf. (CASCON '94), pp. 270-282, Nov. 1994.
5. N. Bermudo, X. Vera, A. González, and J. Llosa, "An Efficient Solver for Cache Miss Equations," Proc. IEEE Int'l Symp. Performance Analysis of Systems and Software (ISPASS'00), 2000.
6. P.P. Chang, S.A. Mahlke, W.Y. Chen, and W.W. Hwu, "Profile-Guided Automatic Inline Expansion for C Programs," Software - Practice and Experience, vol. 25, pp. 249-369, 1992.
7. S. Chatterjee, E. Parker, P.J. Hanlon, and A.R. Lebeck, "Exact Analysis of the Cache Behavior of Nested Loops," Proc. ACM SIGPLAN '01 Conf. Programming Language Design and Implementation (PLDI '01), pp. 286-297, 2001.
8. T.M. Chilimbi, "Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality," Proc. ACM SIGPLAN '01 Conf. Programming Language Design and Implementation (PLDI '01), pp. 191-202, 2001.
9. P. Clauss, "Counting Solutions to Linear and Non-Linear Constraints through Ehrhart Polynomials," Proc. ACM Int'l Conf. Supercomputing (ICS '96), pp. 278-285, 1996.
10. S. Coleman and K. S. McKinley, "Tile Size Selection Using Cache Organization and Data Layout," Proc. ACM SIGPLAN '95 Conf. Programming Language Design and Implementation (PLDI '95), pp. 279-290, June 1995.
11. M. DeGroot, Probability and Statistics. Addison-Wesley, 1998.
12. C. Ding, "Improving Effective Bandwidth through Compiler Enhancement of Global Dynamic Cache Reuse," PhD thesis, Rice Univ., 2000.
13. C. Ding and K. Kennedy, "Improving Effective Bandwidth through Compiler Enhancement of Global Cache Reuse," Proc. 2001 Int'l Parallel and Distributed Processing Symp. (IPDPS '01), Apr. 2001.
14. K.A. Faigin, J.P. Hoeflinger, D.A. Padua, P.M. Petersen, and S.A. Weatherford, "The Polaris Internal Representation," Int'l J. Parallel Programming, vol. 22, no. 5, pp. 553-586, Oct. 1994.
15. P. Feautrier, "Parametric Integer Programming," Operations Research, vol. 22, pp. 243-268, 1988.
16. P. Feautrier, "Automatic Parallelization in the Polytope Model," The Data Parallel Programming Model, G.R. Perrin and A. Darte, eds., pp. 79-103, Springer Verlag, 1996.
17. C. Ferdinand, F. Martin, and R. Wilhelm, "Applying Compiler Techniques to Cache Behavior Prediction," Proc. ACM SIGPLAN Workshop Languages, Compilers, and Tools for Real-Time System (LCTRTS '97), pp. 37-46, 1997.
18. J. Ferrante, V. Sarkar, and W. Thrash, "On Estimating and Enhancing Cache Effectiveness," Proc. Fourth Workshop Compilers for Parallel Computers, pp. 328-343, 1991.
19. B.B. Fraguela, R. Doallo, and E.L. Zapata, "Modeling Set Associative Caches Behavior for Irregular Computations," ACM Performance Evaluation Rev., vol. 26, no. 1, pp. 192-201, June 1998.
20. B.B. Fraguela, R. Doallo, and E.L. Zapata, "Automatic Analytical Modeling for the Estimation of Cache Misses," Proc. Int'l Conf. Parallel Architectures and Compilation Techniques (PACT '99), 1999.
21. D. Gannon, W. Jalby, and K. Gallivan, "Strategies for Cache and Local Memory Management by Global Program Transformations," J. Parallel and Distributed Computing, vol. 5, pp. 587-616, 1988.
22. S. Ghosh, M. Martonosi, and S. Malik, "Cache Miss Equations: A Compiler Framework for Analyzing and Tuning Memory Behavior," ACM Trans. Programming Languages and Systems, vol. 21, pp. 4, pp. 703-746, 1999.
23. N. Gloy and M.D. Smith, "Procedure Placement Using Temporal-Ordering Information," ACM Trans. Programming Languages and Systems, vol. 21, no. 5, pp. 1028-1075, 1999.
24. H. Han and C.-W. Tseng, "A Comparison of Locality Transformations for Iregular Codes," Proc. Fifth Workshop Languages, Compilers, and Run-Time Systems for Scalable Computers, May 2000.
25. J.S. Harper, D.J. Kerbyson, and G.R. Nudd, "Analytical Modeling of Set-Associative Caches," IEEE Trans. Computers, vol. 48, no. 10, pp. 1009-1024, Oct. 1999.
26. J.L. Hennessy and D.A. Patterson, Computer Architecture: A Quantitative Approach, first ed. Morgan Kaufmann, 1996.
27. M. Hill, "DineroIII: A Uniprocessor Cache Simulator," http://www.cs.wisc.edu/~larus/warts.html, 2004.
28. S.C.V.V. Jain, A.R. Lebeck, S. Mundhra, and M. Thottethodi, "Nonlinear Array Layout for Hierarchical Memory Systems," Proc. ACM Int'l Conf. Supercomputing (ICS '99), pp. 444-453, June 1999.
29. M. Kandemir, A. Choudhary, P. Banerjee, and J. Ramanujam, "A Linear Algebra Framework for Automatic Determination of Optimal Data Layouts," IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 2, pp. 115-135, Feb. 1999.
30. R.E. Kessler and M.D. Hill, "Page Placement Algorithms for Large Real-Index Caches," ACM Trans. Computer Systems, vol. 10, no. 4, pp. 338-359, 1992.
31. I. Kodukul, N. Ahmed, and K. Pingali, "Data-Centric Multi-Level Blocking," Proc. ACM SIGPLAN '97 Conf. Programming Language Design and Implementation (PLDI '97), pp. 346-357, 1997.
32. M.S. Lam, E.E. Rothberg, and M.E. Wolf, "The Cache Performance and Optimizations of Blocked Algorithms," Proc. Fourth Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS '91), pp. 63-74, Apr. 1991.
33. C. Lengauer, "Loop Parallelization in the Polytope Model," Proc. Int'l Conf. Concurrency Theory (CONCUR '93), E. Best, ed., pp. 398-416, 1993.
34. M. Martonosi, A. Gupta, and T. Anderson, "MemSpy: Analyzing Memory System Bottlenecks in Programs," Proc. ACM SIGMETRICS '92 Conf. Measurement and Modeling of Computer Systems, pp. 1-12, 1992.
35. The PIP System, "Solving Systems of Affine (In)Equalities: PIP's User's Guide," http://www.prism.uvsq.fr/~paf, 2002.
36. The SUIF Compiler Group, "SUIF: An Infrastructure for Research on Parallelizing and Optimizing Compilers," http://suif.stanford.edu, 2004.
37. S. McFarling, "Program Optimization for Instruction Caches," Proc. Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS '89), pp. 183-191, Apr. 1989.
38. K. McKinley, S. Carr, and C.-W. Tseng, "Improving Data Locality with Loop Transformations," ACM Trans. Programming Languages and Systems, vol. 18, no. 4, pp. 424-453, July 1996.
39. K.S. McKinley and O. Temam, "Quantifying Loop Nest Locality Using SPEC '95 and the Perfect Benchmarks," ACM Trans. Computer Systems, vol. 17, no. 4, pp. 288-336, Sept. 1999.
40. J.M. Mellor-Crummey, D.B. Whalley, and K. Kennedy, "Improving Memory Hierarchy Performance for Irregular Applications Using Data and Computation Reorderings," Int'l J. Parallel Programming, vol. 29, no. 3, pp. 217-247, 2001.
41. A.K. Porterfield, "Software Methods for Improvements of Cache Performance on Supercomputer Applications," PhD thesis, Dept. of Computer Science, Rice Univ., May 1989.
42. W. Pugh, "The Omega Test: A Fast and Practical Integer Programming Algorithm for Dependence Analysis," Comm. ACM, vol. 35, no. 8, pp. 102-114, Aug. 1992.
43. W. Pugh, "Computing Solutions to Presburger Formulas: How and Why," Proc. ACM SIGPLAN '94 Conf. Programming Language Design and Implementation (PLDI '94), pp. 121-134, 1994.
44. G. Rivera and C.-W. Tseng, "Data Transformations for Eliminating Conflict Misses," Proc. ACM SIGPLAN '98 Conf. Programming Language Design and Implementation (PLDI '98), pp. 38-49, 1998.
45. Y. Song and Z. Li, "New Tiling Techniques to Improve Cache Temporal Locality," Proc. ACM SIGPLAN '99 Conf. Programming Language Design and Implementation (PLDI '99), pp. 215-228, May 1999.
46. T. Suganuma, T. Yasue, and T. Nakatani, "An Empirical Study of Method Inlining for a Java Just-in-Time Compiler," Proc. Second Java Virtual Machine Research and Technology Symp., 2002.
47. O. Temam, C. Fricker, and W. Jalby, "Cache Interference Phenomena," Proc. ACM SIGMETRICS '94 Conf. Measurement and Modeling of Computer Systems, pp. 261-271, 1994.
48. O. Temam, E. Granston, and W. Jalby, "To Copy or Not to Copy: A Compile-Time Technique for Accessing when Data Copying Should Be Used to Eliminate Cache Conflicts," Proc. Supercomputing '93, pp. 410-419, 1993.
49. O. Temam and W. Jalby, "Characterizing the Behavior of Sparse Algorithms on Caches," Proc. Supercomputing '92, pp. 578-587, 1992.
50. J. Torrellas, C. Xia, and R.L. Daigle, "Optimizing the Instruction Cache Performance of the Operating System," IEEE Trans. Computers, vol. 47, no. 12, pp. 1363-1381, 1998.
51. R.A. Uhlig, and T.N. Mudge, "Trace-Driven Memory Simulation: A Survey," ACM Computing Surveys, vol. 29, no. 3, pp. 128-170, Sept. 1997.
52. X. Vera, J. Llosa, and A. González, "Near-Optimal Padding for Removing Conflict Misses," Proc. 15th Workshop Languages and Compilers for Parallel Computers (LCPC '02), July 2002.
53. X. Vera, J. Llosa, A. González, and N. Bermudo, "A Fast and Accurate Approach to Analyze Cache Memory Behavior," Proc. European Conf. Parallel Computing (Europar '00), 2000.
54. X. Vera and J. Xue, "Let's Study Whole-Program Cache Behaviour Analytically," Proc. Int'l Symp. High Performance Computer Architecture (HPCA-8), pp. 175-186, Feb. 2002.
55. R. White, F. Mueller, C. Healy, D. Whalley, and M.G. Harmon, "Timing Analysis of Data Caches and Set-Associative Caches," Proc. Third IEEE Real-Time Technology and Applications Symp. (RTAS '97), June 1997.
56. D. Wilde, "A Library for Doing Polyhedral Operations," Technical Report 785, Oregon State Univ., 1993.
57. M.E. Wolf and M.S. Lam, "A Data Locality Optimizing Algorithm," Proc. ACM SIGPLAN '91 Conf. Programming Language Design and Implementation (PLDI '91), pp. 30-44, June 1991.
58. J. Xue, "Unimodular Transformations of Non-Perfectly Nested Loops," Parallel Computing, vol. 22, no. 12, pp. 1621-1645, 1997.
59. J. Xue, Loop Tiling for Parallelism. Boston: Kluwer Academic, Aug. 2000.
60. J. Xue and C.-H. Huang, "Reuse-Driven Tiling for Improving Data Locality," Int'l J. Parallel Programming, vol. 26, no. 6, pp. 671-696, 1998.