Improving effective bandwidth through compiler enhancement of global cache reuse

Journal of Parallel and Distributed Computing

Volumn 64, Issue 1, 2004, Pages 108-134

  Ding, Chen ^a   Kennedy, Ken ^b  

^a University of Rochester   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

Data locality; Data transformation; Global cache reuse; Loop fusion; Program analysis; Reference affinity

Indexed keywords

EID: 1642502420     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2003.09.005     Document Type: Article

References (60)

1. W. Abu-Sufah, D. Kuck, D. Lawrie, On the performance enhancement of paging systems through program analysis and transformations, IEEE Trans. Comput. C 30 (5) (May 1981) 341-356.
2. V. Adve, J. Mellor-Crummey, Using integer sets for data-parallel program analysis and optimization, in: Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation, Montreal, Canada, June 1998.
3. J.R. Allen, D. Callahan, K. Kennedy, Automatic decomposition of scientific programs for parallel execution, in: Proceedings of the Fourteenth Annual ACM Symposium on the Principles of Programming Languages, Munich, Germany, January 1987.
4. J.R. Allen, K. Kennedy, Vector register allocation, IEEE Trans. Comput. 41 (10) (October 1992) 1290-1317.
5. R. Allen, K. Kennedy, Optimizing Compilers for Modern Architectures, Morgan Kaufman, Los Altos, CA, 2001.
6. J. Anderson, S. Amarasinghe, M. Lam, Data and computation transformation for multiprocessors, in: Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara, CA, July 1995.
7. J. Backus, The history of Fortran I, II, and III, in: Wexelblat (Ed.), History of Programming Languages, Academic Press, New York, 1981, pp. 25-45.
8. D. Bailey, Unfavorable strides in cache memory systems, Technical Report RNR-92-015, NASA Ames Research Center, 1992.
9. O. Beckmann, P.H.J. Kelly, Efficient interprocedural data placement optimisation in a parallel library, in: Proceedings of the Fourth Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers, May 1998.
10. L.A. Belady, A study of replacement algorithms for a virtual-storage computer, IBM Systems J. 5 (2) (1966) 78-101.
11. D.C. Burger, J.R. Goodman, A. Kagi, Memory bandwidth limitations of future microprocessors, in: Proceedings of the 23th International Symposium on Computer Architecture, Philadelphia, PA, May 1996.
12. D. Callahan, A Global Approach to Detection of Parallelism, Ph.D. Thesis, Dept. of Computer Science, Rice University, March 1987.
13. D. Callahan, J. Cocke, K. Kennedy, Estimating interlock and improving balance for pipelined machines, Journal of Parallel and Distributed Computing 5 (4) (August 1988) 334-358.
14. T.M. Chilimbi, Efficient representations and abstractions for quantifying and exploiting data reference locality, in: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Snowbird, UT, 2001.
15. T.M. Chilimbi, B. Davidson, J.R. Larus, Cache-conscious structure definition, in: Proceedings of SIGPLAN Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999.
16. M. Cierniak, W. Li, Unifying data and control transformations for distributed shared-memory machines, in: Proceedings of the SIGPLAN '95 Conference on Programming Language Design and Implementation, La Jolla, CA, June 1995.
17. J. Cocke, K. Kennedy, Profitability computations on program flow graphs, Technical Report RC 5123, IBM, 1974.
18. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour M. Yannakakis, The complexity of multiway cuts, in: Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, May 1992.
19. C. Ding, Improving Effective Bandwidth through Compiler Enhancement of Global and Dynamic Cache Reuse, Ph.D. Thesis, Dept. of Computer Science, Rice University, January 2000.
20. C. Ding, K. Kennedy, Memory bandwidth bottleneck and its amelioration by a compiler, in: Proceedings of International Parallel and Distributed Processing Symposium, Cancun. Mexico, May 2000.
21. C. Ding, Y. Zhong, Predicting whole-program locality using reuse-distance analysis, in: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, San Diego, CA, June 2003.
22. J. Ferrante, V. Sarkar, W. Thrash. On estimating and enhancing cache effectiveness. in: U. Banerjee, D. Gelernter, A. Nicolau, D. Padua (Eds.). Languages and Compilers for Parallel Computing, Fourth International Workshop, Springer, Santa Clara, CA, August 1991.
23. D. Gannon, W. Jalby, K. Gallivan, Strategies for cache and local memory management by global program transformation, J. Parallel Distrib. Comput. 5 (5) (October 1988) 587-616.
24. G. Gao, R. Olsen, V. Sarkar, R. Thekkath, Collective loop fusion for array contraction. in: Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, New Haven, CT, August 1992.
25. P. Havlak, K. Kennedy, An implementation of interprocedural bounded regular section analysis, IEEE Trans. Parallel Distrib. Systems 2 (3) (July 1991) 350-360.
26. T.E. Jeremiassen, S.J. Eggers, Reducing false sharing on shared memory multiprocessors through compile time data transformations, in: Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Santa Barbara. CA, July 1995, pp. 179-188.
27. M. Kandemir, A. Choudhary, J. Ramanujam. P. Banerjee, A matrix-based approach to the global locality optimization problem, in: Proceedings of International Conference on Parallel Architectures and Compilation Techniques, 1998.
28. K. Kennedy, Fast greedy weighted fusion, in: Proceedings of the 2000 International Conference on Supercomputing, Santa Fe, NM, May 2000.
29. K. Kennedy, C. Ding, Resource constrained loop fusion, Technical Report TR03-424, Department of Computer Science, Rice University, September 2003.
30. K. Kennedy, U. Kremer, Automatic data layout for distributed memory machines, ACM Trans. Programming Languages Systems (TOPLAS) 20 (4) (1998).
31. K. Kennedy, K.S. McKinley, Typed fusion with applications to parallel and sequential code generation, Technical Report TR93-208 Dept. of Computer Science, Rice University, August 1993 (also available as CRPC-TR94370).
32. D.G. Kirkpatrick, P. Hell, On the completeness of a generalized matching problem. in: The Tenth Annual ACM Symposium on Theory of Computing, 1978.
33. D. Knuth, An empirical study of FORTRAN programs, Software - Practice Experience 1 (1971) 105-133.
34. I. Kodukula, N. Ahmed, K. Pingali, Data-centric multi-level blocking. in: Proceedings of the SIGPLAN '97 Conference on Programming Language Design and Implementation, Las Vegas, NV, June 1997.
35. M. Lam, E. Rothberg, M.E. Wolf, The cache Performance and optimizations of blocked algorithms, in: Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-IV), Santa Clara, CA, April 1991.
36. S. Leung, Array restructuring for cache locality, Ph.D. Thesis, Technical Report UW-CSE-96-08-01, University of Washington, 1996.
37. E. Lewis, C. Lin, L. Snyder, The implementation and evaluation of fusion and contraction in array languages, in: Proceedings of the SIGPLAN '98 Conference on Programming Language Design and Implementation, Montreal. Canada, June 1998.
38. A. Lim, S. Liao. M. Lam, Design and evaluation of locality optimizations using affine partitioning, in: Proceedings of ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Snowbird, UT, June 2001.
39. SimpleScalar LLC, SimpleScalar tool set, www.simplescalar.com.
40. M.E. Mace, Memory storage patterns in parallel processing, Kluwer Academic, Boston, 1987.
41. N. Manjikian, T. Abdelrahman, Fusion of loops for parallelism and locality, IEEE Trans. Parallel Distrib. Systems 8 (1997).
42. R.L. Mattson, J. Gecsei, D. Slutz, I.L. Traiger. Evaluation techniques for storage hierarchies, IBM System J. 9 (2) (1970) 78-117.
43. K.S. McKinley, S. Carr, C.-W. Tseng, Improving data locality with loop transformations, ACM Trans. Programming Languages Systems 18 (4) (July 1996) 424-453.
44. K.S. McKinley, O. Temam, Quantifying loop nest locality using SPEC'95 and the perfect benchmarks, ACM Transactions on Computer Systems 17 (4) (November 1999) 288-336.
45. E. Petrank, D. Rawitz, The hardness of cache conscious data placement, in: Proceedings of ACM Symposium on Principles of Programming Languages, Portland, OR, January 2002.
46. V.K. Pingali, S.A. McKee, W.C. Hsieh, J.B. Carter. Computation regrouping: restructuring programs for temporal data cache locality, in: Proceedings of ACM International Conference oil SuperComputing, 2002.
47. A. Porterfield, Software methods for improvement of cache performance, Ph.D. Thesis, Dept. of Computer Science, Rice University, May 1989.
48. W. Pugh, A practical algorithm for exact array dependence analysis, Comm. ACM 35 (8) (August 1992) 102-114.
49. W. Pugh, E. Rosser, Iteration space slicing for locality, in: Proceedings of the Twelfth Workshop on Languages and Compilers for Parallel Computing, August 1999.
50. S. Scholz, With-Loop-Folding in SAC - condensing consecutive array operations, in: Proceedings of Conference on Implementation of Functional Languages, 1997.
51. Y. Song, Z. Li, New tiling techniques to improve cache temporal locality, in: Proceedings of ACM SIGPLAN Conference on Programming Languages Design and Implementation, Atlanta, GA, May 1999.
52. Y. Song, R. Xu, C. Wang, Z. Li, Data locality enhancement by memory reduction, in: Proceedings of ACM International Conference on Supercomputing, June 2001.
53. R.A. Sugumar, S.G. Abraham, Multi-configuration simulation algorithms for the evaluation of computer architecture designs, Technical Report, University of Michigan, 1993.
54. K.O. Thabit, Cache Management by the Compiler. Ph.D. Thesis, Dept. of Computer Science, Rice University, 1981.
55. M.E. Wolf, M. Lam, A data locality optimizing algorithm, in: Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991.
56. M.J. Wolfe, Optimizing Supercompilers for Supercomputers. Ph.D. Thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, October 1982.
57. D. Wonnacott, Using time skewing to eliminate idle time due to memory bandwidth and network limitations, in: Proceedings of International Parallel and Distributed Processing Symposium, Cancun, Mexico, May 2000.
58. D. Wonnacott, Achieving scalable locality with time skewing, Internat. J. Parallel Programming 30 (3) (June 2002).
59. Q. Yi, V. Adve, K. Kennedy, Transforming loops to recursion for multi-level memory hierarchies, in: Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Vancouver, Canada, June 2000.
60. Y. Zhong, C. Ding, K. Kennedy, Reuse distance analysis for scientific programs, in: Proceedings of Workshop on Languages, Compilers, and Run-time Systems for Scalable Computers, Washington DC, March 2002.