Article

Transparent pointer compression for linked data structures

Authors:

Vikram S. AdveAuthors Info & Claims

MSP '05: Proceedings of the 2005 workshop on Memory system performance

Pages 24 - 35

https://doi.org/10.1145/1111583.1111587

Published: 12 June 2005 Publication History

Abstract

64-bit address spaces are increasingly important for modern applications, but they come at a price: pointers use twice as much memory, reducing the effective cache capacity and memory bandwidth of the system (compared to 32-bit address spaces). This paper presents a sophisticated, automatic transformation that shrinks pointers from 64-bits to 32-bits. The approach is "macroscopic," i.e., it operates on an entire logical data structure in the program at a time. It allows an individual data structure instance or even a subset thereof to grow up to 2³² bytes in size, and can compress pointers to some data structures but not others. Together, these properties allow efficient usage of a large (64-bit) address space. We also describe (but have not implemented) a dynamic version of the technique that can transparently expand the pointers in an individual data structure if it exceeds the 4GB limit. For a collection of pointer-intensive benchmarks, we show that the transformation reduces peak heap sizes substantially by (20% to 2x) for several of these benchmarks, and improves overall performance significantly in some cases.

References

[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.]]

Digital Library

[2]

C. S. Ananian and M. Rinard. Data Size Optimizations for Java Programs. In LCTES, San Diego, CA, Jun 2003.]]

Digital Library

[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.]]

Digital Library

[5]

J. S. Foster, M. Fähndrich, 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.]]

Digital Library

[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.]]

Digital Library

[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://11vm.cs.uiuc.edu.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[11]

D. Liang and M. J. Harrold. Efficient computation of parameterized pointer information for interprocedural analysis. In SAS, July 2001.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[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.]]

Digital Library

[20]

C. B. Zilles. Benchmark health considered harmful. SIGARCH Comput. Archit. News, 29(3):4--5, 2001.]]

Digital Library

Cited By

Wu MMao LLin YJin YLi ZLyu HTang JLu XTang HDong DChen HZang B(2024)Jade: A High-throughput Concurrent Copying Garbage CollectorProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650087(1160-1174)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650087
Koparkar C(2022)A primer on pointer taggingXRDS: Crossroads, The ACM Magazine for Students10.1145/355820029:1(66-68)Online publication date: 6-Oct-2022
https://dl.acm.org/doi/10.1145/3558200
Zhao WBlackburn SMcKinley KJhala RDillig I(2022)Low-latency, high-throughput garbage collectionProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523440(76-91)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523440
Show More Cited By

Index Terms

Transparent pointer compression for linked data structures
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Making context-sensitive points-to analysis with heap cloning practical for the real world
Proceedings of the 2007 PLDI conference

Context-sensitive pointer analysis algorithms with full "heapcloning" are powerful but are widely considered to be too expensive to include in production compilers. This paper shows, for the first time, that a context-sensitive, field-sensitive ...
Automatic pool allocation: improving performance by controlling data structure layout in the heap
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows heuristics to be used to partially control the internal layout of those ...
Automatic pool allocation: improving performance by controlling data structure layout in the heap
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows heuristics to be used to partially control the internal layout of those ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

MSP '05: Proceedings of the 2005 workshop on Memory system performance

June 2005

74 pages

ISBN:1595931473

DOI:10.1145/1111583

General Chair:
Brad Calder
U. C, San Diego
,
Program Chair:
Ben Zorn
Microsoft

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

MSP05

MSP05: Memory Systems Performance Workshop

June 12, 2005

Illinois, Chicago

Acceptance Rates

Overall Acceptance Rate 6 of 20 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
453
Total Downloads

Downloads (Last 12 months)17
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Wu MMao LLin YJin YLi ZLyu HTang JLu XTang HDong DChen HZang B(2024)Jade: A High-throughput Concurrent Copying Garbage CollectorProceedings of the Nineteenth European Conference on Computer Systems10.1145/3627703.3650087(1160-1174)Online publication date: 22-Apr-2024
https://dl.acm.org/doi/10.1145/3627703.3650087
Koparkar C(2022)A primer on pointer taggingXRDS: Crossroads, The ACM Magazine for Students10.1145/355820029:1(66-68)Online publication date: 6-Oct-2022
https://dl.acm.org/doi/10.1145/3558200
Zhao WBlackburn SMcKinley KJhala RDillig I(2022)Low-latency, high-throughput garbage collectionProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523440(76-91)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523440
Zaghloul M(2017)Algorithm 985ACM Transactions on Mathematical Software10.1145/311990444:2(1-9)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3119904
Weinstein MRao A(2017)Algorithm 984ACM Transactions on Mathematical Software10.1145/310499044:2(1-25)Online publication date: 29-Aug-2017
https://dl.acm.org/doi/10.1145/3104990
Mittal SVetter J(2016)A Survey Of Architectural Approaches for Data Compression in Cache and Main Memory SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2015.243578827:5(1524-1536)Online publication date: 1-May-2016
https://dl.acm.org/doi/10.1109/TPDS.2015.2435788
Eldib HWang CSchaumont P(2014)Formal Verification of Software Countermeasures against Side-Channel AttacksACM Transactions on Software Engineering and Methodology10.1145/268561624:2(1-24)Online publication date: 23-Dec-2014
https://dl.acm.org/doi/10.1145/2685616
Fourtounis GPapaspyrou NBerthold JSheeran MNewton R(2014)An efficient representation for lazy constructors using 64-bit pointersProceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing10.1145/2636228.2636232(23-30)Online publication date: 3-Sep-2014
https://dl.acm.org/doi/10.1145/2636228.2636232
van der Spek HHolm CWijshoff H(2012)A Compilation Framework for the Automatic Restructuring of Pointer-Linked Data StructuresHigh-Performance Scientific Computing10.1007/978-1-4471-2437-5_4(97-122)Online publication date: 2012
https://doi.org/10.1007/978-1-4471-2437-5_4
Kwon GSmith-Jackson TBostian C(2011)Socio-cognitive aspects of interoperabilityACM Transactions on Computer-Human Interaction10.1145/2063231.206323418:4(1-21)Online publication date: 30-Dec-2011
https://dl.acm.org/doi/10.1145/2063231.2063234
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents