The Potential of Computation Regrouping for Improving Locality

Proceedings of the ACM/IEEE SC 2004 Conference: Bridging Communities

Volumn , Issue , 2004, Pages

  Ding, Chen ^a   Orlovich, Maksim ^a  

^a University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK PROGRAMS; CACHE ORGANIZATION; CACHE UTILIZATION; COMPUTATION REGROUPING; CONTROL STRUCTURE; DATA DEPENDENCE; EXACT CONTROLS; MODERN COMPUTER SYSTEMS;

EID: 84934325958     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2004.58     Document Type: Conference Paper

References (44)

1. J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence to data dependence. In Conference Record of the Tenth Annual ACM Symposium on the Principles of Programming Languages, Austin, TX, Jan. 1983.
2. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, October 2001.
3. J. Backus. The history of Fortran I, II, and III. In Wexelblat, editor, History of Programming Languages, pages 25-45. Academic Press, 1981.
4. L. A. Belady. A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2):78-101, 1966.
5. D. C. Burger, J. R. Goodman, and A. Kagi. Memory bandwidth limitations of future microprocessors. In Proceedings of the 23th International Symposium on Computer Architecture, Philadelphia, PA, May 1996.
6. D. Callahan, J. Cocke, and K. Kennedy. Estimating interlock and improving balance for pipelined machines. Journal of Parallel and Distributed Computing, 5(4):334-358, Aug. 1988.
7. M. C. Carlisle. Olden: parallelizing programs with dynamic data structures on distributed-memory machines. PhD thesis, Department of Computer Science, Princeton University, June 1996.
8. S. Carr and K. Kennedy. Blocking linear algebra codes for memory hierarchies. In Proceedings of the Fourth SIAM Conference on Parallel Processing for Scientific Computing, Chicago, IL, Dec. 1989.
9. M. Cierniak and 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, California, 1995.
10. R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and K. Zadeck. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems, 13(4):451-490, Oct. 1991.
11. C. Ding and K. Kennedy. Improving cache performance in dynamic applications through data and computation reorganization at run time. In Proceedings of the SIGPLAN'99 Conference on Programming Language Design and Implementation, Atlanta, GA, May 1999.
12. C. Ding and K. Kennedy. Improving effective bandwidth through compiler enhancement of global cache reuse. Journal of Parallel and Distributed Computing, 64(1), 2004.
13. C. Ding and Y. Zhong. Compiler-directed run-time monitoring of program data access. In Proceedings of the first ACM SIGPLAN Workshop on Memory System Performance, Berlin, Germany, June 2002.
14. C. Ding and Y. Zhong. 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.
15. C. Fang, S. Carr, S. Onder, and Z. Wang. Reusedistance-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.
16. J. Ferrante, K. Ottenstein, and J. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319-349, July 1987.
17. G. Gao, R. Olsen, V. Sarkar, and R. Thekkath. Collective loop fusion for array contraction. In Proceedings of the Fifth Workshop on Languages and Compilers for Parallel Computing, New Haven, CT, Aug. 1992.
18. M. Garey and D. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, NY, 1979.
19. H. Han and C. W. Tseng. Locality optimizations for adaptive irregular scientific codes. Technical report, Department of Computer Science, University of Maryland, College Park, 2000.
20. M. D. Hill. Aspects of cache memory and instruction buffer performance. PhD thesis, University of California, Berkeley, November 1987.
21. S. A. Huang and J. P. Shen. 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.
22. K. Kennedy. Fast greedy weighted fusion. In Proceedings of the 2000 International Conference on Supercomputing, Santa Fe, NM, May 2000.
23. K. Kennedy and K. S. McKinley. Typed fusion with applications to parallel and sequential code generation. Technical Report TR93-208, Dept. of Computer Science, Rice University, Aug. 1993. (also available as CRPC-TR94370).
24. I. Kodukula, N. Ahmed, and 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.
25. M. S. Lam and R. P. Wilson. Limits of control flow on parallelism. In Proceedings of International Symposium on Computer Architecture, Queensland, Australia, 1992.
26. G. Marin and J. Mellor-Crummey. 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.
27. R. L. Mattson, J. Gecsei, D. Slutz, and I. L. Traiger. Evaluation techniques for storage hierarchies. IBM System Journal, 9(2):78-117, 1970.
28. K. S. McKinley and O. Temam. Quantifying loop nest locality using SPEC'95 and the perfect benchmarks. ACM Transactions on Computer Systems, 17(4):288-336, 1999.
29. J. Mellor-Crummey, R. Fowler, and D. B. Whalley. Tools for application-oriented performance tuning. In Proceedings of the 15th ACM International Conference on Supercomputing, Sorrento, Italy, June 2001.
30. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance for irregular applications. International Journal of Parallel Programming, 29(3), June 2001.
31. A. Nicolau and J. A. Fisher. Measuring the parallelism available for very long instruction word architecture. IEEE Transactions on Computers, 33(11), 1984.
32. V. S. Pingali, S. A. McKee, W. C. Hsieh, and J. B. Carter. Restructuring computations for temporal data cache locality. International Journal of Parallel Programming, 31(4), August 2003.
33. W. Pugh and E. Rosser. Iteration space slicing for locality. In Proceedings of the Twelfth Workshop on Languages and Compilers for Parallel Computing, August 1999.
34. X. Shen, Y. Zhong, and C. Ding. Regression-based multi-model prediction of data reuse signature. In Proceedings of the 4th Annual Symposium of the Las Alamos Computer Science Institute, Sante Fe, New Mexico, November 2003.
35. Y. Song and Z. Li. New tiling techniques to improve cache temporal locality. In Proceedings of ACM SIGPLAN Conference on Programming Languages Design and Implementation, Atlanta, Georgia, May 1999.
36. M. M. Strout, L. Carter, and J. Ferrante. Compiletime composition of run-time data and iteration reorderings. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, San Diego, CA, June 2003.
37. M. M. Strout and P. Hovland. Metrics and models for reordering transformations. In Proceedings of the first ACM SIGPLAN Workshop on Memory System Performance, Washington DC, June 2004.
38. K. B. Theobald, G. R. Gao, and L. J. Hendren. On the limits of program parallelism and its smoothability. Technical Report ACAPS Memo 40, School of Computer Science, McGill University, June 1992.
39. M. E. Wolf and M. Lam. A data locality optimizing algorithm. In Proceedings of the SIGPLAN'91 Conference on Programming Language Design and Implementation, Toronto, Canada, June 1991.
40. D. Wonnacott. Achieving scalable locality with time skewing. International Journal of Parallel Programming, 30(3), June 2002.
41. Q. Yi, V. Adve, and 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.
42. X. Zhang and R. Gupta. Cost effective dynamic program slicing. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2004.
43. Y. Zhong, C. Ding, and 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.
44. Y. Zhong, S. G. Dropsho, and C. Ding. Miss rate preidiction across all program inputs. In Proceedings of the 12th International Conference on Parallel Architectures and Compilation Techniques, New Orleans, Louisiana, September 2003.