1995 · 70 citations · 9 references
ComputingComputer EngineeringComputer ScienceCompilersComputer ArchitectureProgramming LanguagesCachingInterpreter DesignRegister AllocationVirtual MemoryCache StateExecution Time AnalysisInstruction Cache BehaviorRegister-based Virtual MachinesStack-based Virtual MachinesState Machine DesignState Machine ModelsVirtual Machines
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 executed in the version corresponding to the new state. In the static method a state machine that keeps track of the cache state is added to the compiler. Common instructions exist in specialized versions for several states, but it is not necessary to have a version of every instruction for every cache state. Stack manipulation instructions are optimized away.
9
James Bell · Communications of the ACM · 1973 · 305 citations · Full text
David R. Ditzel, Hubert R. McLellan · 1982 · 131 citations · Full text
Paul Klint · Software Practice and Experience · 1981 · 45 citations
Exploring a Stack Architecture
R.P. Blake · Computer · 1977 · 30 citations