Garbage collecting the world: one car at a time

  • Authors:
  • Richard L. Hudson;Ron Morrison;J. Eliot B. Moss;David S. Munro

  • Affiliations:
  • Department of Computer Science, University of Massachusetts, Amherst, MA;School of Mathematical and Computational Sciences, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, Scotland;Department of Computer Science, University of Massachusetts, Amherst, MA;School of Mathematical and Computational Sciences, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, Scotland

  • Venue:
  • Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new garbage collection algorithm for distributed object systems, called DMOS (Distributed. Mature Object Space), is presented. It is derived from two previous algorithms, MOS (Mature Object Space), sometimes called the train algorithm, and PMOS (Persistent Mature Object Space). The contribution of DMOS is that it provides the following unique combination of properties for a distributed collector: safety, completeness, non-disruptiveness, incrementality, and scalability. Furthermore, the DMOS collector is non-blocking and does not use global tracing.