Michael Lippautz
Research Areas
Authored Publications
Google Publications
Other Publications
Sort By
Concurrent Marking of Shape-Changing Objects
Ulan Degenbaev
Proceedings of the 2019 ACM SIGPLAN International Symposium on Memory Management, ACM, New York, NY, USA, pp. 89-102
Preview abstract
Efficient garbage collection is a key goal in engineering high-performance runtime systems. To reduce pause times, many collector designs traverse the object graph concurrently with the application, an optimization known as concurrent marking. Traditional concurrent marking imposes strict invariants on the object shapes: 1) static type layout of objects, 2) static object memory locations, 3) static object sizes. High performance virtual machines for dynamic languages, for example, the V8 JavaScript virtual machine used in the Google Chrome web browser, generally violate these constraints in pursuit of high throughput for a single thread. Taking V8 as an example, we show that some object shape changes are safe and can be handled by traditional concurrent marking algorithms. For unsafe shape changes, we introduce novel wait-free object snapshotting and lock-based concurrent marking algorithms and prove that they preserve key invariants. We implemented both algorithms in V8 and achieved performance improvements on various JavaScript benchmark suites and real-world web workloads. Concurrent marking of shape-changing objects using the wait-free object snapshotting algorithm is enabled by default in Chrome since version 64.
View details
Preview abstract
A collaborative approach to reclaiming memory in heterogeneous software systems.
View details
Cross-Component Garbage Collection
Ulan Degenbaev
Proceedings of the ACM on Programming Languages, vol. 2 Issue OOPSLA (2018), 151:1-151:24
Preview abstract
Embedding a modern language runtime as a component in a larger software system is popular these days. Communication between these systems often requires keeping references to each others' objects. In this paper we present and discuss the problem of cross-component memory management where reference cycles across component boundaries may lead to memory leaks and premature reclamation of objects may lead to dangling cross-component references. We provide a generic algorithm for effective, efficient, and safe garbage collection over component boundaries, which we call cross-component tracing. We designed and implemented cross-component tracing in the Chrome web browser where the JavaScript virtual machine V8 is embedded into the rendering engine Blink. Cross-component tracing from V8's JavaScript heap to Blink's C++ heap improves garbage collection latency and eliminates long-standing memory leaks for real websites in Chrome. We show how cross-component tracing can help web developers to reason about reachability and retainment of objects spanning both V8 and Blink components based on Chrome's heap snapshot memory tool. Cross-component tracing was enabled by default for all websites in Chrome version 57 and is also deployed in other widely used software systems such as Opera, Cobalt, and Electron.
View details
Fast, Multicore-scalable, Low-fragmentation Memory Allocation Through Large Virtual Memory and Global Data Structures
Martin Aigner
Christoph M. Kirsch
Ana Sokolova
Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, ACM, New York, NY, USA, pp. 451-469
Distributed Queues in Shared Memory - Multicore Performance and Scalability through Quantitative Relaxation
Andreas Haas
Thomas A. Henzinger
Ana Sokolova
Christoph M. Kirsch
Ali Sezgin
Proceedings of the ACM International Conference on Computing Frontiers, ACM, New York, NY, USA (2013), 17:1-17:9
Short-term Memory for Self-collecting Mutators
Martin Aigner
Andreas Haas
Christoph M. Kirsch
Ana Sokolova
Stephanie Stroka
Andreas Unterweger
Proceedings of the International Symposium on Memory Management, ACM, New York, NY, USA (2011), pp. 99-108
