Bytecode compression via profiled grammar rewriting

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 36, Issue 5, 2001, Pages 148-154

  Evans, William S ^a   Fraser, Christopher W ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Algoriths; Bytecode interpretation; Context free grammars; D.3.3 Programming Languages : Processors optimization; Design; Economics; Experimentation; Languages; Performance; Program compression; Run time environments; Theory; Variable to fixed length codes

Indexed keywords

EID: 0043122282     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/381694.378827     Document Type: Article

References (27)

1. B. Abali, H. Franke, D. E. Poff, and T. B. Smith. Performance of hardware compressed main memory. Research report RC21799, IBM T. J. Watson Research Center (July 2000).
2. M. Adler and J.-l.. Gailly. The gzip home page. http://www.gzip.org.
3. C. Benveniste, P. Franaszek, and J. Robinson. Cachememory interfaces in compressed memory systems. Research report RC21662, IBM T. J. Watson Research Center (Feb. 2000).
4. R. D. Cameron. Source encoding using syntactic information models. IEEE Transactions on Information Theory, 34(4) pp.843-850 (1988).
5. th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.122-130 (June 1985).
6. Connectix Corp. RAM Doubler 9. http://www.connectix.com/products/rd9.html. (Nov. 2000).
7. K. D. Cooper and N. McIntosh. Enhanced code compression for embedded RISC processors. PLDI, pp.139-149 (May 1999).
8. S. K. Debray, W. Evans, R. Muth, and B. de Sutter. Compiler techniques for code compaction. TOPLAS, 22(2) pp.378-415 (March 2000).
9. J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 13(2) pp.94-102 (Feb. 1970).
10. P. Eck, X. Changsong, and R. Matzner. A new compression scheme for syntactically structured messages (programs) and its application to Java and the internet. Proc. Data Compression Conference (poster session), p.542 (1998).
11. J. Ernst, W. Evans, C. W. Fraser, S. Lucco, and T. A. Proebsting. Code compression. PLDI, pp.358-365 (June 1997).
12. W. Evans. Compression via guided parsing. Proc. Data Compression Conference (poster session), p.544 (1998). http://www.cs.arizona.edu/people/will/papers/
13. M. Franz and T. Kistler. Slim Binaries. Communications of the ACM, 40(12) pp.87-94 (Dec. 1997).
14. C. W. Fraser. Automatic inference of models for statistical code compression. PLDI, pp.242-246 (May 1999).
15. C. W. Fraser and D. R. Hanson. A Retargetable C Compiler: Design and Implementation. Addison Wesley Longman, 1995.
16. C. W. Fraser and T. A. Proebsting. Custom instruction sets for code compression. Unpublished (October 1995). http://www.research.microsoft.com/~toddpro/
17. J. Hoogerbrugge, L. Augusteijn, J. Trum, and R. van de Wiel. A code compression system based on pipelined interpreters. Softw. Pract. Exper., 29(11) pp.1005-1023 (1999).
18. D. Huffman. A method for the construction of minimum redundancy codes. Proc. of IRE, 40 pp.1098-1101 (1952).
19. J. M. Lake. Prediction by grammatical match. Proc. Data Compression Conference, pp.153-162 (March, 2000).
20. C. Lefurgy, E. Piccininni, and T. Mudge. Reducing code size with run-time decompression. Proceedings of the 6th International Symposium on High-Performance Computer Architecture (HPCA) (Jan 2000).
21. S. Y. Liao. Code generation and optimization for embedded digital signal processors. Ph.D. thesis, MIT (1996).
22. S. Lucco. Split-stream dictionary program compression. PLDI, pp. 27-34 (June 2000).
23. C. G. Nevill-Manning. Inferring sequential structure. Ph.D. thesis, University of Waikato, (1996).
24. T. A. Proebsting. Optimizing an ANSI C interpreter with superoperators. POPL, pp.322-332 (Jan. 1995).
25. I. Tabus, G. Korodi, and J. Rissanen. Text compression based on variable-to-fixed codes for Markov sources. Proc. Data Compression Conference, pp.133-141 (March, 2000).
26. B. P. Tunstall. Synthesis of noiseless compression codes. Ph.D. thesis, Georgia Inst. Technology (1967).
27. P. R. Wilson, S. F. Kaplan, and Y. Smaragdakis. The case for compressed caching in virtual memory systems. USENIX Technical Conference (June 1999).