ACM Home Page
Please provide us with feedback. Feedback
No bit left behind: the limits of heap data compression
Full text PdfPdf (350 KB)
Source
International Symposium on Memory Management archive
Proceedings of the 7th international symposium on Memory management table of contents
Tucson, AZ, USA
SESSION: Heap measurement and analysis I table of contents
Pages 111-120  
Year of Publication: 2008
ISBN:978-1-60558-134-7
Authors
Jennifer B. Sartor  The University of Texas at Austin, Austin, TX, USA
Martin Hirzel  IBM Watson Research Center, Hawthorne, NY, USA
Kathryn S. McKinley  The University of Texas at Austin, Austin, TX, USA
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1375634.1375651
What is a DOI?

ABSTRACT

On one hand, the high cost of memory continues to drive demand for memory efficiency on embedded and general purpose computers. On the other hand, programmers are increasingly turning to managed languages like Java for their functionality, programmability, and reliability. Managed languages, however, are not known for their memory efficiency, creating a tension between productivity and performance. This paper examines the sources and types of memory inefficiencies in a set of Java benchmarks. Although prior work has proposed specific heap data compression techniques, they are typically restricted to one model of inefficiency. This paper generalizes and quantitatively compares previously proposed memorysaving approaches and idealized heap compaction. It evaluates a variety of models based on strict and deep object equality, field value equality, removing bytes that are zero, and compressing fields and arrays with a limited number and range of values. The results show that substantial memory reductions are possible in the Java heap. For example, removing bytes that are zero from arrays is particularly effective, reducing the application's memory footprint by 41% on average.We are the first to combine multiple savings models on the heap, which very effectively reduces the application by up to 86%, on average 58%. These results demonstrate that future work should be able to combine a high productivity programming language with memory efficiency.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
A. W. Appel and M. J. R. Gonc¸alves. Hash-consing garbage collection. Technical Report CS-TR-412-93, Princeton University, 1993.
 
4
5
 
6
A. Cardon and M. Crochemore. Partitioning a graph in o(jaj log2 jvj). Theoretical Computer Science, 1982.
7
8
9
10
 
11
12
13
14
15
16
17
18
19
 
20
J. B. Sartor, M. Hirzel, and K. McKinley. No bit left behind: The limits of heap data compression (extended version). Technical Report TR-08-17, The University of Texas at Austin, 2008.
 
21
Semiconductor Industry Association. SIA world semiconductor forcast 2007?2010, Nov. 2007. http://www.sia-online.org/pre release.cfm?ID=455.
22
23
24
 
25
TIOBE Software. TIOBE programming community index, 2007. http://tiobe.com.tpci.html.
26
27
28
 
29
30

Collaborative Colleagues:
Jennifer B. Sartor: colleagues
Martin Hirzel: colleagues
Kathryn S. McKinley: colleagues