One VM to rule them all
Thomas Wuerthinger, Christian Wimmer, Andreas Woess, Lukas Stadler, Gilles Duboscq, Christian Humer, Gregor Richards, Douglas Simon, Mario Wolczko
29 October 2013
Building high-performance virtual machines is a complex and expensive undertaking; many popular languages still have low-performance implementations. We describe a new approach to virtual machine (VM) construction that amortizes much of the effort in initial construction by allowing new languages to be implemented with modest additional effort. The approach relies on abstract syntax tree (AST) interpretation where a node can rewrite itself to a more specialized or more general node, together with an optimizing compiler that exploits the structure of the interpreter. The compiler uses speculative assumptions and deoptimization in order to produce efficient machine code. Our initial experience suggests that high performance is attainable while preserving a modular and layered architecture, and that new high-performance language implementations can be obtained by writing little more than a stylized interpreter.
Venue : Onward! 2013
External Link: https://dl.acm.org/citation.cfm?id=2509581