On-the-fly garbage collection for several mutators

Authors:
Jan E. Jonker
Affiliations:
Department of Mathematics and Computing Science, University of Groningen, AV Groningen, The Netherlands
Venue:
Distributed Computing
Year:
1992

Citing 3
Cited 3

Algorithms for on-the-fly garbage collection

ACM Transactions on Programming Languages and Systems (TOPLAS)
"Algorithms for on-the-fly garbage collection" revisited

Information Processing Letters
On-the-fly garbage collection: an exercise in cooperation

Communications of the ACM

Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Lock-free parallel and concurrent garbage collection by mark&sweep

Science of Computer Programming
Simple concurrent garbage collection almost without synchronization

Formal Methods in System Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm is given for on-the-fly garbage collection in the presence of several mutators. It uses two colours and is a generalization of Ben-Ari's algorithm (1984). The correctness proof is based on the lexical orderings of several tuples of state space functions. It is shown that in a certain sense the algorithm is optimal. Three variations of the algorithm are given and proved correct. In the case that there is only one mutator one of these variations closely resembles a well-known incorrect algorithm.