Tue 27 Oct 2015 14:37 - 15:00 at Grand Station 3 - Session 3, Compilation

Storage strategies have been proposed as a run-time optimization for the PyPy Python implementation and with promising results for optimizing execution speed and memory requirements. However, it remained unclear whether the approach works equally well in other dynamic languages. Furthermore, while PyPy is based on RPython, a language to write VMs with reusable components such as a tracing just-in-time compiler and garbage collection, the strategies design itself was not generalized to be reusable across languages implemented using that same toolchain.

In this paper, we present a general design and implementation for storage strategies and show how they can be re-used across different RPython-based languages. We evaluate the performance of our implementation for RSqueak, an RPython-based VM for Squeak/Smalltalk and show that storage strategies can indeed offer performance benefits for other dynamic programming languages. We furthermore evaluate the generality of our implementation by applying it to Topaz, a Ruby VM, and Pycket, a Racket implementation.

Tue 27 Oct
Times are displayed in time zone: (GMT-04:00) Eastern Time (US & Canada) change

13:30 - 15:00: DLS - Session 3, Compilation at Grand Station 3
dls201513:30 - 13:52
dls201513:52 - 14:15
Matthias GrimmerJohannes Kepler University Linz, Chris SeatonOracle Labs / University of Manchester, Roland SchatzJohannes Kepler University Linz, Thomas WuerthingerOracle Labs, Hanspeter MössenböckJohannes Kepler University Linz
dls201514:15 - 14:37
David LeopoldsederJohannes Kepler University Linz, Lukas StadlerOracle Labs, Christian WimmerOracle Labs, Hanspeter MössenböckJohannes Kepler University Linz
dls201514:37 - 15:00
Tim FelgentreffHPI, Germany, Tobias PapeHasso-Plattner-Institute, Potsdam, Robert HirschfeldHPI, Carl Friedrich Bolz-TereickKing's College London , Anton GulenkoTU Berlin