Virtual Stack Research Articles

Stack caching for interpreters

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.

A virtual stack facility for mini‐computer and microcomputer implementation of the finite element method

AbstractIn this paper, the efficient implementation of the finite element method on mini‐computers and microcomputers is considered. The main limitations of memory and address space are overcome and a software solution proposed with the use of a virtual stack facility which is implemented and tested. A new replacement algorithm for a virtual stack is presented and shown to be more efficient than other known implementations.

Finite element software for mini-computers

In this paper the efficient implementation of the Finite Element Method (FEM) on mini-computers is considered. The main limitations of memory and address space are overcome and a software solution proposed using a Virtual Stack Facility (VSF) which is implemented and tested. A new replacement algorithm for a virtual stack is presented and shown to be more efficient than other implementations.

ALPHA-a high-performance LISP machine equipped with a new stack structure and garbage collection system

ALPHA is a dedicated machine designed for high-speed list processing. In this article, we describe a highly effective stack which can support a value cache and virtual stack, and high-speed garbage collection algorithm for virtual memory. These new ideas have been studied in ALPHA. ALPHA is designed as a back end processor for a large computer under TSS. ALPHA allows TSS users to do more high-speed list processing than a large computer does. Currently UTILISP is operating on ALPHA and runs several times faster than MACLISP on the DEC 2060.