Subheap-Augmented Garbage Collection

Benjamin Karel, University of Pennsylvania

Abstract

Automated memory management avoids the tedium and danger of manual techniques. However, as no programmer input is required, no widely available interface exists to permit principled control over sometimes unacceptable performance costs. This dissertation explores the idea that performance-oriented languages should give programmers greater control over where and when the garbage collector (GC) expends effort. We describe an interface and implementation to expose heap partitioning and collection decisions without compromising type safety. We show that our interface allows the programmer to encode a form of reference counting using Hayes' notion of key objects. Preliminary experimental data suggests that our proposed mechanism can avoid high overheads suffered by tracing collectors in some scenarios, especially with tight heaps. However, for other applications, the costs of applying subheaps---in human effort and runtime overheads---remain daunting.

Subject Area

Computer science

Recommended Citation

Karel, Benjamin, "Subheap-Augmented Garbage Collection" (2019). Dissertations available from ProQuest. AAI27664661.
https://repository.upenn.edu/dissertations/AAI27664661

Share

COinS