Corpus ID: 5030402

Randomized Distributed Garbage Collection

  title={Randomized Distributed Garbage Collection},
  author={Kaoutar El Maghraoui and Travis Desell},
With the explosive growth of the Internet and distributed computing, disributed garbage collection (DGC) has become a very important area of research. Single-processor garbage collection is by itself one of the challenging areas of research in computer science. In distributed environments, the problem of garbage collection becomes even harder and more challenging. This is mainly due to the additional overhead that is incurred by network communication and global sychronization. While most… Expand

Figures from this paper


Garbage collection of actors
This paper considers the garbage collection of concurrent objects for which it is necessary to know not only “reachability,” the usual criterion for reclaiming data, but also the “state” (active orExpand
A distributed garbage collector for active objects
The paper describes the proposed garbage collector, together with its implementation and performance for a concurrent object-oriented language running on a local area network of workstations. Expand
An Efficient Garbage Collection Scheme for Parallel Computer Architectures
The paper examines the problems of garbage collection on parallel machines, and proposes a new scheme which has been implemented on the Flagship parallel machine architecture, and is efficient because it requires no synchronisation. Expand
Generational garbage collection for Haskell
Detailed measurements which demonstrate that a generational garbage collector can substantially out-perform non-generational collectors, despite the frequency of write operations in the underlying implementation, are presented. Expand
Distributed Garbage Collection Using Reference Counting
An elegant algorithm for the real-time garbage collection of distributed memory that makes use of reference counting and is simpler than distributed mark-scan algorithms and is also truly real- time unlike distributed mark -scan algorithms. Expand
Generational reference counting: a reduced-communication distributed storage reclamation scheme
The generational reference counting algorithm is presented, the algorithm is proved correct, and some refinements that make it more efficient are discussed, which may provide a significant saving in overall execution time on machines in which message passing is expensive. Expand
Generational garbage collection and the radioactive decay model
Analysis of the model leads to a new kind of generational garbage collector whose effectiveness does not depend upon heuristics that predict which objects will live longer than others. Expand
A protocol for distributed reference counting
A protocol for distributed reference counting is developed, how it can be used to detect instemces where update in place is allowed and an implementation scheme is presented that requires bookkeeping messages only for tire copying of references across processor boundaries. Expand
Garbage collecting the Internet
Internet programming languages such as Java present new challenges to garbage-collection design. The spectrum of garbage-collection schema for linked structures distributed over a network are revie...
A Foundation for Actor Computation
An actor language is presented which is an extension of a simple functional language, and an operational semantics for this extension is provided, and it is shown that the three forms of equivalence, namely, convex, must, and may equivalences, collapse to two in the presence of fairness. Expand