Generating cache hints for improved program efficiency

Journal of Systems Architecture

Volumn 51, Issue 4, 2005, Pages 223-250

  Beyls, Kristof ^a   D'Hollander, Erik H ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Compiler optimization; EPIC; Replacement policy; Reuse distance; Source cache hint; Target cache hint

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SOFTWARE REUSABILITY; DATA PROCESSING; OPTIMIZATION; PROGRAM COMPILERS; PROGRAM PROCESSORS;

COMPILER OPTIMIZATION; EPIC; REPLACEMENT POLICY; REUSE DISTANCE; SOURCE CACHE HINT; TARGET CACHE HINT;

CACHE MEMORY;

EID: 14944380098     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2004.09.004     Document Type: Article

References (55)

1. N. Ahmed, N. Mateev, K. Pingali, Synthesizing transformations for locality enhancement of imperfectly-nested loop nests, in: ICS, 2000, pp. 141-152
2. L.A. Belady A study of replacement algorithms for a virtual-storage computer IBM Systems Journal 5 2 1966 78 101
3. K. Beyls, Software methods to improve data locality and cache behavior, PhD thesis, Ghent University, June 2004
4. K. Beyls, and E. D'Hollander Compiler generated multithreading to alleviate memory latency Multithreaded Processors and Chip-Multiprocessors Journal of Universal Computer Science 6 10 2000 968 993 (special issue)
5. K. Beyls, E.H. D'Hollander, Reuse distance as a metric for cache behavior, in: Proceedings of PDCS'01, August 2001, pp. 617-662
6. M. Brehob, R.J. Enbody, An analytic model of locality and caching, Technical Report MSU-CSE-99-31, Michigan State University, August 1999
7. J.F. Cantin, and M.D. Hill Cache performance for selected SPEC CPU2000 benchmarks Computer Architecture News (CAN) 2001
8. G.C. Caşcaval, Compile-time performance prediction of scientific programs, PhD thesis, University of Illinois at Urbana-Champaign, 2000
9. K.K. Chan, C.C. Hay, J.R. Keller, G.P. Kurpanek, F.X. Schumacher, and J. Zheng Design of the HP PA 7200 CPU Technical information from the laboratories of Hewlett-Packard Company Hewlett-Packard Journal 47 1 1996 25 33
10. S. Chatterjee, V. Jain, A.R. Lebeck, S. Mundhra, M.S. Thottethodi, Nonlinear array layouts for hierarchical memory systems, in: 13th ACM International Conference on Supercomputing (ICS'99), June 1999
11. S. Chatterjee, E. Parker, P. Hanlon, A.R. Lebeck, Exact analysis of the cache behavior of nested loops, in: PLDI, 2001, pp. 286-297
12. T.M. Chilimbi, M.D. Hill, J.R. Larus, Cache-conscious structure layout, in: Proceedings of the ACM SIGPLAN'99 Conference on Programming Language Design and Implementation, May 1999, pp. 1-12
13. P. Clauss, Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs, in: ACM International Conference on Supercomputing, ACM, May 1996, pp. 278-285
14. P. Clauss, and V. Loechner Parametric analysis of polyhedral iteration spaces Journal of VLSI Signal Processing 19 1998 179 194
15. E. D'Hollander, F. Zhang, and Q. Wang The Fortran parallel transformer and its programming environment Journal of Information Science 106 7 1998 293 317
16. C. Ding, Y. Zhong, Predicting whole-program locality through reuse distance analysis, in: PLDI'03, ACM, 2003
17. C. Fang, S. Carr, S. Onder, Z. Wang, Reuse-distance-based miss-rate prediction on a per instruction basis, in: Workshop on Memory System Performance (MSP), 2004
18. P. Feautrier, Automatic parallelization in the polytope model, in: The Data Parallel Programming Model, 1996, pp. 79-103
19. B.B. Fraguela, R. Doallo, J. Touriño, and E.L. Zapata A compiler tool to predict memory hierarchy performance of scientific codes Parallel Computing 30 2004 225 248
20. S. Ghosh, Cache miss equations: compiler analysis framework for tuning memory behaviour, PhD thesis, Princeton University, November 1999
21. P. Grun, N. Dutt, A. Nicolau, MIST: An algorithm for memory miss traffic management, in: International Conference on Computer Aided Design, 2000, pp. 431-437
22. M.D. Hill, and A.J. Smith Evaluating associativity in CPU caches IEEE Transactions on Computers 38 12 1989 1612 1630
23. IA-64 Application Developer's Architecture Guide, May 1999
24. Intel Itanium 2 Processor Reference Manual, June 2002
25. P. Jain, S. Devadas, D. Engels, L. Rudolph, Software-assisted replacement mechanisms for embedded systems, in: International Conference on Computer Aided Design, November 2001, pp. 119-126
26. N.P. Jouppi, Improving direct-mapped cache performance by the addition of a small fully-associative cache and prefetch buffers, in: The 17th ISCA, May 1990, pp. 364-373
27. M. Kandemir, P. Banerjee, A. Choudhary, J. Ramanujam, and E. Ayguade An integer linear programming approach for optimizing cache locality Proceedings of the 1999 Conference on Supercomputing, ACM SIGARCH, NY, June 1999 1999 ACM Press 500 509
28. M. Kandemir, A. Choudhary, J. Ramanujam, and P. Banerjee A matrix-based approach to the global locality optimization problem Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques (PACT'98), Paris, France, October 12-18, 1998 1998 IEEE Computer Society Press 306 313
29. V. Kathail, M.S. Schlansker, B.R. Rau, HPL_PD architecture specification: Version 1.1. Technical Report HPL-93-80(R.1), Hewlett-Packard, February 2000
30. K. Kennedy, and K.S. McKinley Maximizing loop parallelism and improving data locality via loop fusion and distribution 1993 Workshop on Languages and Compilers for Parallel Computing, Number 768, Portland, Ore. 1993 Springer Verlag Berlin 301 320
31. I. Kodukula, N. Ahmed, K. Pingali, Data-centric multi-level blocking, in: PLDI, 1997, pp. 346-357
32. K.S. McKinley, S. Carr, and C.-W. Tseng Improving data locality with loop transformations ACM Transactions on Programming Languages and Systems 18 4 1996 424 453
33. T.C. Mowry, M.S. Lam, and A. Gupta Design and evaluation of a compiler algorithm for prefetching ACM SIGPLAN Notices 27 9 1992 62 73
34. Open64 compiler, < http://sourceforge.net/projects/open64>
35. T. Ozawa, Y. Kimura, S. Nishizaki, Cache miss heuristics and preloading techniques for general-purpose programs, in: MICRO'95, Ann Arbor, Michigan, November 29-December 1, 1995, IEEE Computer Society TC-MICRO and ACM SIGMICRO, pp. 243-248
36. W. Pugh Counting solutions to Presburger formulas: how and why ACM SIGPLAN Notices 29 6 1994 121 134
37. B. Rau, V. Kathail, and S. Aditya Machine-description driven compilers for EPIC and VLIW processors Design Automation for Embedded Systems 4 1999 71 118
38. G. Rivera, C.-W. Tseng, Data transformations for eliminating conflict misses, in: Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI'98), June 1998, pp. 38-49
39. J. Sánchez, and A. González Fast, accurate and flexible data locality analysis PACT'98, Paris, France, October 12-18, 1998 1998 IEEE Computer Society Press 124 129
40. J. Sanchez, and A. Gonzalez A locality sensitive multi-module cache with explicit management Proceedings of the 1999 Conference on Supercomputing, ACM SIGARCH, NY, June 20-25, 1999 1999 ACM Press 51 59
41. M.S. Schlansker, and B.R.R. Cover EPIC: Explicitly parallel instruction computing IEEE Computer 33 2 2000 37 45
42. A. Schrijver Theory of Linear and Integer Programming 1986 John Wiley & Sons New York
43. A. Seznec, and F. Bodin Skewed-associative caches Proceedings of PARLE'93, Munich, Germany, June 14-17, 1993 Lecture Notes in Computer Science 1993 Springer-Verlag 305 316
44. R. Sree, A. Settle, I. Bratt, D.A. Connors, Compiler-directed resource management for active code regions, in: Proceedings of the 7th Workshop on Interaction between Compilers and Computer Architecture, February 2003
45. G. Tyson, M. Farrens, J. Matthews, A.R. Pleszkun, A modified approach to data cache management, in: MICRO'95, Ann Arbor, Michigan, November 29-December 1, 1995, IEEE Computer Society TC-MICRO and ACM SIGMICRO, pp. 93-103
46. S.P. Vanderwiel, and D.J. Lilja Data prefetch mechanisms ACM Computing Surveys 32 2 2000 174 199
47. X. Vera, J. Xue, Let's study whole-program cache behavior analytically, in: High-Performance Computer Architecture (HPCA'02), 2002, pp. 175-186
48. S. Verdoolaege, The Barvinok library, < http://freshmeat.net/projects/ barvinok>
49. S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, M. Bruynooghe, Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations, in: International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES, 2004
50. Z. Wang, K. McKinley, A. Rosenberg, C. Weems, Using the compiler to improve cache replacement decisions, in: PACT'02, September 2002
51. M.E. Wolf, M.S. Lam, A data locality optimizing algorithm, in: Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, 1991, pp. 30-44
52. M. Wolfe High Performance Compilers for Parallel Computing 1996 Addison-Wesley
53. W.A. Wong, J.-L. Baer, Modified LRU policies for improving second-level cache behavior, in: HPCA-6, January 8-12, 2000, pp. 49-60
54. H. Yang, R. Govindarajan, G.R. Gao, Z. Hu, Compiler-assisted cache replacement: problem formulation and performance evaluation, in: 16th International Workshop on Languages and Compilers for Parallel Computing (LCPC'03), October 2003
55. F. Zhang, and E. D'Hollander Using hammock graphs to structure programs IEEE Transactions on Software Engineering 30 4 2004 231 245