Lightweight reference affinity analysis

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 2005, Pages 131-140

  Shen, Xipen ^a   Gao, Yaoqing ^b   Ding, Chen ^a   Archambault, Roch ^b  

^a University of Rochester   (United States)

^b IBM TORONTO LAB   (Canada)

Author keywords

Affinity; Compiler; Data Interleving; Data Regrouping; Frequency; Memory Optimization

Indexed keywords

ARRAYS; BENCHMARKING; PROGRAM COMPILERS; VECTORS;

AFFINITY; DATA INTERLEVING; DATA REGROUPING; MEMORY OPTIMIZATION;

DATA STRUCTURES;

EID: 32844461703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1088149.1088167     Document Type: Conference Paper

References (16)

1. R. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures: A Dependence-based Approach. Morgan Kaufmann Publishers, October 2001.
2. J. Andersen, S. Amarasinghe, and 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.
3. D. Bailey. Unfavorable strides in cache memory systems. Technical Report RNR-92-015, NASA Ames Research Center, 1992.
4. 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, June 1995.
5. C. Ding and K. Kennedy. Inter-array data regrouping. In Proceedings of The 12th International Workshop onLanguages and Compilers for Parallel Computing, La Jolla, California, August 1999.
6. C. Ding and K. Kennedy. Improving effective bandwidth through compiler enhancement of global cache reuse. Journal of Parallel and Distributed Computing, 64(1), 2004.
7. M. Emami, R. Ghiya, and L. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, 1994.
8. T. E. Jeremiassen and 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, pages 179-188, Santa Barbara, CA, July 1995.
9. K. Kennedy and U. Kremer. Automatic data layout for distributed memory machines. ACM Transactions on Programming Languages and Systems, 20(4), 1998.
10. G. Rivera and C.-W. Tseng. Data transformations for eliminating conflict misses. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, 1998.
11. V. Sarkar. Determining average program execution times and their variance. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, Oregon, January 1989.
12. R. Silvera, R. Archambault, D. Fosbury, and B. Blainey. Branch and value profile feedback for whole program optimization. Unpublished, no date given.
13. T. A. Wagner, V. Maverick, S. L. Graham, and M. A. Harrison. Accurate static estimators for program optimization. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, 1994.
14. M.Wegman and K, Zadeck. Constant propagation with conditional branches. In Conference Record of the Twelfth Annual ACM Symposium on the Principles of Programming Languages, New Orleans, LA, January 1985.
15. Y. Zhong, M. Orlovich, X. Shen, and C. Ding. Array regrouping and structure splitting using whole-program reference affinity. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, June 2004.
16. K. McKinley, O. Temam. A quantitative analysis of loop nest locality. In Proceedings of the seventh international conference on Architectural support for programming languages and operating systems, Cambridge, MA, US, 1996