Training Distributed Garbage: The DMOS Collector
نویسندگان
چکیده
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. A complete description of the DMOS collector is given, together with its associated correctness arguments and its relationship to other work.
منابع مشابه
The Derivation of a New DMOS Distributed Garbage Collector
This talk describes the derivation of a modularised version of the DMOS distributed garbage collection algorithm. DMOS appears to exhibit a unique combination of attractive characteristics for a distributed garbage collector but the original algorithm is known to contain a bug and, previous to this work, lacks a satisfactory, understandable implementation. A modularised DMOS algorithm is develo...
متن کاملEnsuring the Safety of Distributed Garbage Collection in DMOS
An orthogonally persistent system maintains data beyond any program execution. The principle of persistence identification implies that persistence by reachability be used to determine which objects are to be maintained in the store. A particular execution may cause objects to become unreachable—garbage. Any efficient implementation of a persistent system must incorporate a garbage collector to...
متن کاملA First Implementation of the DMOS Garbage Collector
The DMOS, (Distributed Mature Object Space [Hudson et al. 1997]), garbage collection algorithm represents a step forward in distributed garbage collection. The algorithm possesses many properties which are desirable and/or essential for a distributed garbage collection mechanism. These properties are: safety, completeness, incremental, asynchronous, decentralization and non-disruptiveness. To a...
متن کاملGarbage Collecting the Grid: A Complete DGC for Activities
Grids are becoming more and more dynamic, running parallel applications on large scale and heterogeneous resources. Explicitly stopping a whole distributed application is becoming increasingly difficult. In that context, there is a strong need to free resources a soon as they become useless, leading to automatic termination, using distributed garbage collecting techniques. We propose in this pa...
متن کاملStarting with Termination: A Methodology for Building Distributed Garbage Collection Algorithms
We propose an effective methodology in which a distributed garbage collector may be derived from a distributed termination algorithm and a centralized garbage collector in a manner that preserves interesting properties of the original collector, such as completeness. To illustrate our technique we show how two distributed termination algorithms, credit recovery and task balancing, may be suitab...
متن کامل