Aditya Gupta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Aditya Gupta has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Artem Pelenitsyn
Purdue University, West Lafayette, USA
1 shared publication - Chaitanya S. Koparkar
The Mathworks, Inc., Natick, USA
1 shared publication - Michael Vollmer
University of Kent, Canterbury, United Kingdom
1 shared publication - Mike Rainey
Carnegie Mellon University, Pittsburgh, USA
1 shared publication - Milind Kulkarni
Purdue University, West Lafayette, USA
1 shared publication - Ryan R. Newton
Purdue University, West Lafayette, USA
1 shared publication
Latest Publications
- Open Access
- 20 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Garbage Collection for Mostly Serialized Heaps
Over the years, traditional tracing garbage collectors have accumulated assumptions that may not hold in new language designs. For instance, we usually assume that run-time objects do not hold addressable sub-parts and have a size of at least one pointer. These fail in systems striving to eliminate pointers and represent data in a dense, serialized form, such as the Gibbon compiler. We propose a new memory management strategy for language runtimes with mostly serialized heaps. It uses a hybrid, generational collector, where regions are bump-allocated into the young generation and objects are bump-allocated within those regions. Minor collections copy data into larger regions in the old generation, compacting it further. The old generation uses region-level reference counting. The resulting system maintains high performance for data traversal programs, while significantly improving performance on other kinds of allocation patterns.
- 20 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-14
Open AccessGarbage Collection for Mostly Serialized Heaps
Over the years, traditional tracing garbage collectors have accumulated assumptions that may not hold in new language designs. For instance, we usually assume that run-time objects do not hold addressable sub-parts and have a size of at least one pointer. These fail in systems striving to eliminate pointers and represent data in a dense, serialized form, such as the Gibbon compiler. We propose a new memory management strategy for language runtimes with mostly serialized heaps. It uses a hybrid, generational collector, where regions are bump-allocated into the young generation and objects are bump-allocated within those regions. Minor collections copy data into larger regions in the old generation, compacting it further. The old generation uses region-level reference counting. The resulting system maintains high performance for data traversal programs, while significantly improving performance on other kinds of allocation patterns.