Just-in-time compilers offer the biggest achievable payoff performance-wise, but their implementation is a non-trivial, time-consuming task affecting the interpreter's maintenance for years to come, too. Recent research addresses this issue by providing ways of leveraging existing just-in-time compilation infrastructures.
Though there has been considerable research on improving the efficiency of just-in-time compilers, the area of optimizing interpreters has gotten less attention as if the implementation of a dynamic translation system was the ültima ratio" for efficiently interpreting programming languages. We present optimization techniques for improving the efficiency of interpreters without requiring just-in-time compilation thereby maintaining the ease-of-implementation characteristic that brought many people to implementing an interpreter in the first place.
%0 Conference Paper
%1 Brunthaler:2010:EIU
%A Brunthaler, Stefan
%B Proceedings of the 6th Symposium on Dynamic Languages
%D 2010
%I ACM
%K Bytecode Interpreter Quickening
%N 12
%P 1--14
%R 10.1145/1899661.1869633
%T Efficient Interpretation Using Quickening
%X Just-in-time compilers offer the biggest achievable payoff performance-wise, but their implementation is a non-trivial, time-consuming task affecting the interpreter's maintenance for years to come, too. Recent research addresses this issue by providing ways of leveraging existing just-in-time compilation infrastructures.
Though there has been considerable research on improving the efficiency of just-in-time compilers, the area of optimizing interpreters has gotten less attention as if the implementation of a dynamic translation system was the ültima ratio" for efficiently interpreting programming languages. We present optimization techniques for improving the efficiency of interpreters without requiring just-in-time compilation thereby maintaining the ease-of-implementation characteristic that brought many people to implementing an interpreter in the first place.
@inproceedings{Brunthaler:2010:EIU,
abstract = {Just-in-time compilers offer the biggest achievable payoff performance-wise, but their implementation is a non-trivial, time-consuming task affecting the interpreter's maintenance for years to come, too. Recent research addresses this issue by providing ways of leveraging existing just-in-time compilation infrastructures.
Though there has been considerable research on improving the efficiency of just-in-time compilers, the area of optimizing interpreters has gotten less attention as if the implementation of a dynamic translation system was the "ultima ratio" for efficiently interpreting programming languages. We present optimization techniques for improving the efficiency of interpreters without requiring just-in-time compilation thereby maintaining the ease-of-implementation characteristic that brought many people to implementing an interpreter in the first place.},
acmid = {1869633},
added-at = {2014-03-19T15:33:29.000+0100},
author = {Brunthaler, Stefan},
biburl = {https://www.bibsonomy.org/bibtex/2def5d2401de60904b8fb06564195486d/gron},
booktitle = {Proceedings of the 6th Symposium on Dynamic Languages},
description = {Efficient interpretation using quickening},
doi = {10.1145/1899661.1869633},
interhash = {e79b403b4d056b4d58d72d80a4b84880},
intrahash = {def5d2401de60904b8fb06564195486d},
issn = {0362-1340},
issue_date = {December 2010},
keywords = {Bytecode Interpreter Quickening},
month = oct,
number = 12,
numpages = {14},
pages = {1--14},
publisher = {ACM},
series = {DLS},
timestamp = {2014-12-09T13:49:24.000+0100},
title = {{Efficient Interpretation Using Quickening}},
year = 2010
}