Transparent pointer compression for linked data structures

Proceedings of the 3rd 2005 ACM SIGPLAN Workshop on Memory Systems Performance, MSP 2005

Volumn , Issue , 2005, Pages 24-35

  Lattner, Chris ^a   Adve, Vikram S ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Cache; Data layout; Pointer compression; Recursive data structure; Static analysis

Indexed keywords

BENCHMARKING; CACHE MEMORY; DATA STRUCTURES; STATIC ANALYSIS;

AUTOMATIC TRANSFORMATIONS; CACHE; CACHE CAPACITY; DATA LAYOUTS; LINKED DATA STRUCTURES; MEMORY BANDWIDTHS; MODERN APPLICATIONS; RECURSIVE DATA STRUCTURES;

DATA COMPRESSION;

EID: 38149007294     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1111583.1111587     Document Type: Conference Paper

References (20)

1. A. Adl-Tabatabai, J. Bharadwaj, M. Cierniak, M. Eng, J. Fang, B. Lewis, B. Murphy, and J. Stichnoth. Improving 64-bit Java IPF performance by compressing heap references. In Proc. 2004 Int'l Symposium, on Code Generation and Optimization, pages 100-110, Mar. 2004.
2. C. S. Ananian and M. Rinard. Data Size Optimizations for Java Programs. In LCTES, San Diego, CA, Jun 2003.
3. T. Austin, et al. The Pointer-intensive Benchmark Suite. www.cs.wisc.edu/~austin/ptr-dist.html, Sept 1995.
4. B.-C. Cheng and W. mei Hwu. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. In PLDI, pages 57-69, Vancouver, British Columbia, Canada, June 2000.
5. J. S. Foster, M. Fahndrich, and A. Aiken. Polymorphic versus monomorphic flow-insensitive points-to analysis for c. In SAS'00: Proc. 7th Int'l Symp. on Static Analysis, pages 175-198, London, UK, 2000.
6. G. Heiser, K. Elphinstone, J. Vochteloo, S. Russell, and J. Liedtke. The Mungi single-address-space operating system. Software - Practice and Experience, 28(9):901-928, 1998.
7. C. Lattner. Macroscopic Data Structure Analysis and Optimization. PhD thesis, Computer Science Dept., University of Illinois at Urbana-Champaign, Urbana, IL, May 2005. See http://llvm.cs.uiuc.edu.
8. C. Lattner and V. Adve. Automatic Pool Allocation for Disjoint Data Structures. In Proc. ACM SIGPLAN Workshop on Memory System Performance, Berlin, Germany, Jun 2002.
9. C. Lattner and V. Adve. LLVM: A Compilation Framework for Lifelong Program Analysis and Transformation. In Proc. 2004 Int'l Symp. on Code Generation and Optimization (CGO'04), San Jose, USA, Mar 2004.
10. C. Lattner and V. Adve. Automatic pool allocation: Improving performance by controlling data structure layout in the heap. In Proc. 2005 ACM SIGPLAN Conf. on Programming Language Design and Implementation (PLDI'05), Chicago, IL, Jun 2005.
11. D. Liang and M. J. Harrold. Efficient computation of parameterized pointer information for interprocedural analysis. In SAS, July 2001.
12. J. C. Mogul, J. F. Bartlett, R. N. Mayo, and A. Srivastava. Performance implications of multiple pointer sizes. In USENIX Winter, pages 187-200, 1995.
13. E. M. Nystrom, H.-S. Kim, and W. mei W. Hwu. Bottom-up and top-down context-sensitive summary-based pointer analysis. In SAS, 2004.
14. A. Rogers, M. Carlisle, J. Reppy, and L. Hendren. Supporting dynamic data structures on distributed memory machines. TOPLAS, 17(2), Mar. 1995.
15. H. Shacham, M. Page, B. Pfaff, E.-J. Goh, N. Modadugu, and D. Boneh. On the effectiveness of address-space randomization. In Proc. ACM Conf. on Computer And Communications Security, pages 298-307, 2004.
16. M. Takagi and K. Hiraki. Field array compression in data caches for dynamically allocated recursive data structure. In Proceedings of 5th International Symposium on High Performance Computing (ISHPC'03), Tokyo-Odaiba, Japan, October 2003, pages 127-145.
17. D. N. Truong, F. Bodin, and A. Seznec. Improving cache behavior of dynamically allocated data structures. In Proceedings of the International Conference on Parallel Architectures and Compilation Techniques (PACT'98), pages 322-329, Oct. 1998.
18. C. Yarvin, R. Bukowski, and T. Anderson. Anonymous RPC: Low-latency protection in a 64-bit address space. In USENIX Summer, pages 175-186, 1993.
19. Y. Zhang and R. Gupta. Data compression transformations for dynamically allocated data structures. In International Conference on Compiler Construction (CC), Apr 2002.
20. C. B. Zilles. Benchmark health considered harmful. SIGARCH Comput. Archit. News, 29(3):4-5, 2001.