ACM Home Page
Please provide us with feedback. Feedback
Multicodes: optimizing virtual machines using bytecode sequences
Full text PdfPdf (84 KB)
Source Conference on Object Oriented Programming Systems Languages and Applications archive
Companion of the 18th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications table of contents
Anaheim, CA, USA
POSTER SESSION: Posters table of contents
Pages: 328 - 329  
Year of Publication: 2003
ISBN:1-58113-751-6
Authors
Ben Stephenson  University of Western Ontario, London, ON, Canada
Wade Holst  University of Western Ontario, London, ON, Canada
Sponsors
SIGPLAN: ACM Special Interest Group on Programming Languages
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 21,   Citation Count: 4
Additional Information:

abstract   references   cited by   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/949344.949436
What is a DOI?

ABSTRACT

A virtual machine optimization technique that makes use of bytecode sequences is introduced. The process of determining candidate sequences is discussed and performance gains achieved when applied to a Java interpreter are presented. The suitability of this optimization for JVMs that perform just-in-time compilation is also discussed.




Collaborative Colleagues:
Ben Stephenson: colleagues
Wade Holst: colleagues