A low overhead method for recovering unused memory inside regions

Authors:
Matthew Davis;Peter Schachte;Zoltan Somogyi;Harald Søndergaard
Affiliations:
The University of Melbourne, Victoria, Australia;The University of Melbourne, Victoria, Australia;The University of Melbourne, Victoria, Australia;The University of Melbourne, Victoria, Australia
Venue:
Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Year:
2013

Citing 8
Cited 0

Implementation of the typed call-by-value λ-calculus using a stack of regions

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Better static memory management: improving region-based analysis of higher-order languages

PLDI '95 Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation
A LISP garbage-collector for virtual-memory computer systems

Communications of the ACM
Combining region inference and garbage collection

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Region-based memory management in cyclone

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Reconsidering custom memory allocation

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Garbage collection safety for region-based memory management

Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Towards region-based memory management for Go

Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automating memory management improves both resource safety and programmer productivity. One approach, region-based memory management [9] (RBMM), applies compile-time reasoning to identify points in a program at which memory can be safely reclaimed. The main advantage of RBMM over traditional garbage collection (GC) is the avoidance of expensive runtime analysis, which makes reclaiming memory much faster. On the other hand, GC requires no static analysis, and, operating at runtime, can have significantly more accurate information about object lifetimes. In this paper we propose a hybrid system that seeks to combine the advantages of both methods while avoiding the overheads that previous hybrid systems incurred. Our system can also reclaim array segments whose elements are no longer reachable.