Garbage Collection and Efficiency in Dynamic Metacircular Runtimes: An Experience Report
In dynamic object-oriented languages, low-level mechanisms such as just-in-time compilation, object allocation, garbage collection (GC) and method dispatch are often handled by virtual machines (VMs). VMs are typically implemented using static languages, allowing only few changes at run time. In such systems, the VM is not part of the language and interfaces to memory management or method dispatch are fixed, not allowing for arbitrary adaptation. Furthermore, the implementation can typically not be inspected or debugged with standard tools used to work on application code.
This paper reports on our experience building Bee, a dynamic Smalltalk runtime, written in Smalltalk. Bee is a Dynamic Metacircular Runtime (DMR) and seamlessly integrates the VM into the application and thereby overcomes many restrictions of classic VMs, for instance by allowing arbitrary code modifications of the VM at run time. Furthermore, the approach enables developers to use their standard tools for application code also for the VM, allowing them to inspect, debug, understand, and modify a DMR seamlessly.
We detail our experience of implementing GC, compilation, and optimizations in a DMR. We discuss examples where we found that DMRs can improve understanding of the system, provide tighter control of the software stack, and facilitate research. We also show that in high-level benchmarks the Bee DMR performance is close to that of a widely used Smalltalk VM.
Tue 24 Oct Times are displayed in time zone: Tijuana, Baja California change
|10:30 - 11:00|
|Dynamic Atomicity: Optimizing Swift memory management|
|11:00 - 11:30|
|Object equivalence: Revisiting Object Equality Profiling (An Experience Report)|
|11:30 - 12:00|
|Garbage Collection and Efficiency in Dynamic Metacircular Runtimes: An Experience Report|