Stack Caching for Interpreters

@inproceedings{Ertl1995StackCF,
  title={Stack Caching for Interpreters},
  author={M. Anton Ertl},
  booktitle={PLDI},
  year={1995}
}
An interpreter can spend a significant part of its execution time on accessing arguments of virtual machine instructions. This paper explores two methods to reduce this overhead for virtual stack machines by caching top-of-stack values in (real machine) registers. The dynamic method is based on having, for every possible state of the cache, one specialized version of the whole interpreter; the execution of an instruction usually changes the state of the cache and the next instruction is… CONTINUE READING
Highly Cited
This paper has 79 citations. REVIEW CITATIONS

Topics

Statistics

0510'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

79 Citations

Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.