Write a Blog >>
ISMM 2018
co-located with PLDI 2018

We propose a scalable, cycle-collecting, decentralized, reference
counting garbage collector with partial tracing. The
algorithm is based on the Brownbridge system but uses four
different types of references to label edges. Memory usage
is O (log n) bits per node, where n is the number of nodes in
the graph. The algorithm assumes an asynchronous network
model with a reliable reordering channel. It collects garbage
in O (E a ) time, where E a is the number of edges in the in-
duced subgraph. The algorithm uses termination detection
to manage the distributed computation, a unique identifier
to break the symmetry among multiple collectors, and a
transaction-based approach when multiple collectors conflict.
Unlike existing algorithms, ours is not centralized, does
not require barriers, does not require migration of nodes,
does not require back-pointers on every edge, and is stable
against concurrent mutation.

Mon 18 Jun
Times are displayed in time zone: Eastern Time (US & Canada) change

10:45 - 12:15
Reference Counting and Techniques for C-family LanguagesISMM 2018 at Discovery AB
Chair(s): Emery D. BergerUniversity of Massachusetts, Amherst
Detailed Heap Profiling
ISMM 2018
Stuart BymaEPFL, Switzerland, James LarusEPFL
FRC: A High-Performance Concurrent Parallel Deferred Reference Counter for C++
ISMM 2018
Charles TrippTerrain Data, USA, David HydeStanford University, USA, Benjamin Grossman-PonemonTerrain Data, USA
Distributed Garbage Collection for General Graphs
ISMM 2018
Steven R. BrandtLouisiana State University, Hari KrishnanFacebook, n.n., Costas BuschLouisiana State University, USA, Gokarna SharmaKent State University, USA