No bit left behind: The limits of heap data compression

International Symposium on Memory Management, ISMM

Volumn , Issue , 2008, Pages 111-120

  Sartor, Jennifer B ^a   Hirzel, Martin ^b   McKinley, Kathryn S ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Compression; Heap

Indexed keywords

COMPRESSION; FIELD VALUES; FUTURE WORKS; HEAP; HEAP DATUMS; HIGH COSTS; HIGH PRODUCTIVITIES; MEMORY EFFICIENCIES; MEMORY FOOTPRINTS; MEMORY REDUCTIONS; ONE HANDS; PRIOR WORKS; PROGRAMMING LANGUAGES;

BENCHMARKING; COMPACTION; COMPUTER PROGRAMMING LANGUAGES; GENERAL PURPOSE COMPUTERS; JAVA PROGRAMMING LANGUAGE; LINGUISTICS; QUERY LANGUAGES;

DATA COMPRESSION;

EID: 57349153961     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375634.1375651     Document Type: Conference Paper

References (30)

1. B. Alpern, el al. The Jalapeño virtual machine. IBM Systems Journal, 39(l):211-238, 2000.
2. C. S. Ananian and M. Rinard. Data size optimizations for Java programs. In Languages, Compiler, and Tool Support for Embedded Systems, 2003.
3. A. W. Appel and M. J. R. Gonçalves. Hash-eonsing garbage collection. Technical Report CS-TR-412-93, Princeton University, 1993.
4. D. Bacon. S. Fink, and D. Grove. Space- and time-efficient implementation of the Java object model. In European Conference for Object-Oriented Programming, 2002.
5. S. M. Blackburn, et al. The DaCapo benchmarks: Java benchmarking development and analysis. In Object-Oriented Programming, Systems, Languages, and Applications, 2006.
6. 2 |v|). Theoretical Computer Science, 1982.
7. G. Chen, M. Kandemir, and M. J. Irwin. Exploiting frequent held values in Java objects for reducing heap memory reqirements. In Virtual Execution Environments (VEE), 2005.
8. G. Chen, M. Kandemir, N. Vijaykrishnan, and M. J. Irwin. Field level analysis for heap space optimization in embedded Java environments. In International Symposium on Memory Management, 2004.
9. G. Chen, M. Kandemir, N. Vijaykrishnan, M. J. Irwin, B. Mathiske, and M. Wolczko. Heap compression for memory-constrained Java environments. In Object-Oriented Programming, Systems, Languages, and Applications, 2003.
10. N. D. Cooprider and J. D. Regehr. Offline compression for on-chip RAM. In Programming Language Design and implementation, 2007.
11. S. Dieekmann and U. Hölzle. A study of allocation behavior of the SPECjvm98 Java benchmarks. In European Conference for Object-Oriented Programming, 1999.
12. J. Ernst, W. Evans, C. W. Frascr, S. Lueco. and T. A. Proebsting. Code compression. In Programming Language Design and Implementation, 1997.
13. M. D. Ernst, J. Coekrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. In International Conference on Software Engineering (ICSE), 1999.
14. W. S. Evans and C. W. Fraser. Bytecode compression via profiled grammar rewriting. In Programming Language Design and Implementation, 2001.
15. S. Hangal and M. S. Lam. Tracking Down Software Bugs Using Automatic Anomaly Detection. In International Conference on Software Engineering, 2002.
16. M. Hirzel, J. Henkel, A. Diwan, and M. Hind. Understanding the connectivity of heap objects. In International Symposium on Memory Management, 2002.
17. D. Marinov and R. O'Callahan. Object equality profiling. In Object-Oriented Programming, Systems, Languages, and Applications, 2003.
18. N. Mitchell and G. Sevitsky. The causes of bloat, the limits of health. In Object-Oriented Programming, Systems, Languages, and Applications, 2007.
19. W. Pugh. Compressing Java class files. In Programming Language Design and Implementation, 1999.
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. SI A world semiconductor forcasl 2007-2010. Nov. 2007. http://www.sia-online.org/pre-relcase.cfm?ID=455
22. R. Shaham, E. K. Kolodner, and M. Sagiv. Heap profiling for space-efficient Java. In Programming Language Design and Implementation, 2001.
23. A. Shankar, S. S. Sastry, R. Bodik, and J. E. Smith. Runtime specialization with optimistic heap analysis. In Object-Oriented Programming, Systems, Languages, and Applications, 2005.
24. M. Stephenson, J. Babb, and S. Amarasinghe. Bilwtdlh analysis with application to silicon compilation. In Programming Language Design and Implementation, 2000.
25. TIOBE Software. TIOBE programming community index, 2007. http://tiobe.-com.tpci.html.
26. B. Titzer, J. S. Auerbach, D. F. Bacon, and J. Palsberg. The ExoVM system for automatic VM application reduction. In Programming Language Design and Implementation, 2007.
27. B. L. Titzer. Virgil: Objects on the head of a pin. In Object-Oriented Programming, Systems, Languages, and Applications, 2006.
28. B. L. Titzer and J. Palsberg. Vertical object layout and compression for fixed heaps. In Compilers, Architectures, and Synthesis for Embedded Systems, 2007.
29. Y. Zhang and R. Gupta. Compression transformations for dynamically allocated data structures. In International Conference on Compiler Construction, 2002.
30. C. Zilles. Accordion arrays: Selective compression of Unicode arrays in Java. In International Symposium on Memory Management, 2007.