Abstract

This paper introduces superoperators, an optimization technique for bytecoded interpreters. Superoperators are virtual machine operations automatically synthesized from smaller operations to avoid costly per-operation overheads. Superoperators decrease executable size and can double or triple the speed of interpreted programs. The paper describes a simple and effective heuristic for inferring powerful superoperators from the usage patterns of simple operators. The paper describes the design and implementation of a hybrid translator/interpreter that employs superoperators. From a specification of the superoperators (either automatically inferred or manually chosen), the system builds an efficient implementation of the virtual machine in assembly language. The system is easily retargetable and currently runs on the MIPS R3000 and the SPARC.

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
150	The Implementation of the Icon Programming Language - Griswold, Griswold - 1986
111	Functional Programming - Field, Harrison - 1988
103	Threaded code - BELL - 1973
54	A retargetable compiler for ansi c - Fraser, Hanson - 1991
40	fast optimal instruction selection and tree parsing - Burg - 1992
20	Interpretation techniques - Klint - 1981
17	A code generation interface for - Fraser, Hanson - 1991
13	Sesha Pratap. SaberC: an interpreter-based programming environment for the C language - Kaufer, Lopez - 1988
11	Two-Level Hybrid Interpreter/Native Code Execution for Combined Space-Time Program E ciency - Pittman - 1987
7	Cint: A RISC interpreter for the C programming language - Davidson, Gresch - 1987
5	si --- an interpreter for the C language - Feuer - 1985
4	Two-level hybrid interpreter /native code execution for combined space-time efficiency - Pittman - 1987