Cache-conscious coallocation of hot data streams

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn 2006, Issue , 2006, Pages 252-262

  Chilimbi, Trishul M ^a   Shaham, Ran ^b  

^a MICROSOFT RESEARCH   (United States)

^b Amuse Toy and Game Development   (Israel)

Author keywords

Cache optimization; Data locality; Data profiling; Dynamic allocation; Hot data streams; Memory layout

Indexed keywords

CACHE OPTIMIZATION; DATA LOCALITY; DATA PROFILING; DYNAMIC ALLOCATION; HOT DATA STREAMS; MEMORY LAYOUTS;

BENCHMARKING; CACHE MEMORY; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAM LISTINGS; DATA REDUCTION;

DATA STORAGE EQUIPMENT;

EID: 33746070806     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1133255.1134011     Document Type: Conference Paper

References (21)

1. E. Berger, B. Zorn, and K. McKinley. "Composing high-performance memory allocators." In ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), June 2001.
2. B. Calder et. al. "Cache-conscious data placement." In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Oct. 1998.
3. T.M. Chilimbi. "Efficient Representations and Abstractions for Quantifying and Exploiting Data Reference Locality." In ACM SIGPLAN'01 Conference on Programming Language Design and Implementation (PLDI), June 2001.
4. T.M. Chilimbi. "On the stability of temporal data reference profiles." In International Conference on Parallel Architectures and Compilation Techniques (PACT), Aug. 2001.
5. T.M. Chilimbi, J.R. Larus, and M.D. Hill. "Cache-conscious structure layout." In ACM SIGPLAN'99 Conference on Programming Language Design and Implementation (PLDI), May 1999.
6. T.M. Chilimbi, J.R. Larus, and B. Davidson. "Cache-conscious structure definition." In ACM SIGPLAN'99 Conference on Programming Language Design and Implementation (PLDI), May 1999.
7. P. Crescenzi et al. "A compendium of NP optimization problems. " ww.nada.kth.se/~viggo/problemlist/compendium.html
8. N. Gloy et. al "Procedure placement using temporal ordering information." In Proceedings of the 30th Annual ACM/IEEE International Symposium on Microarchitecture (MICRO), Dec. 1997.
9. R. Gonzalez et al. "Energy dissipation in general-purpose microprocessors." In IEEE Journal of Solid State Circuits, 31(9), Sept. 1996.
10. S. Guyer and K. McKinley. "Finding your cronies: static analysis for dynamic object colocation." In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Oct. 2004.
11. X. Huang et al. "The garbage collection advantage: Improving program locality." In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), Oct. 2004.
12. M. M. Halldorsson. "Approximations of weighted independent set and hereditary subset problems." In Journal of Graph Algorithms and Applications, Vol. 4, 2000.
13. M. Hirzel and T.M. Chilimbi. "Bursty Tracing: A Framework for Low-Overhead Temporal Profiling." In Workshop on Feedback Directed and Dynamic Optimizations (FDDO), Dec. 2001.
14. T. Kistler and M. Franz. "Automated data-member layout of heap objects to improve memory-hierarchy performance." In Transactions on Programming Languages and Systems (TOPLAS), volume 22, 2000.
15. E. Petrank and D. Rawitz. "The hardness of cache-conscious data placement." In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Jan 2002.
16. S. Rubin, R. Bodik, and T.M. Chilimbi. "An Efficient Profile-Analysis Framework for Data-Layout Optimizations." In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Jan 2002.
17. M. Seidl and B. Zorn. "Segregating heap objects by reference behavior and lifetime." In Proceedings of the 8th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), Oct 1998.
18. A. Srivastava, A. Edwards, and H. Vo. Vulcan: Binary transformation in a distributed environment. In MSR-TR-2001-50, 2001.
19. D. Truong, F. Bodin, and A. Seznec. "Improving cache behavior of dynamically allocated data structures." In International Conference on Parallel Architectures and Compilation Techniques (PACT), 1998.
20. Y. Zhong et al. "Array regrouping and structure splitting using whole-program reference affinity." In ACM SIGPLAN'04 Conference on Programming Language Design and Implementation (PLDI), 2004.
21. C. Lattner and V. Adve. "Automatic pool allocation: Improving performance by controlling data structure layout in the heap." In ACM SIGPLAN'05 Conference on Programming Language Design and Implementation (PLDI), 2005.