Book Chapter10.1007/3-540-17945-3_10
Distributed garbage collection using reference counting
David Bevan
- 15 Jun 1987
- pp 176-187
172
TL;DR: 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.
read more
Abstract: We describe here an elegant algorithm for the real-time garbage collection of distributed memory. This algorithm makes use of reference counting and is simpler than distributed mark-scan algorithms. It is also truly real-time unlike distributed mark-scan algorithms. It requires no synchronisation between messages and only sends a message between nodes when a reference is deleted. It is also relatively space efficient using at most five bits per reference.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
The Physiology of the Grid An Open Grid Services Architecture for Distributed Systems Integration
Ian Foster,Carl Kesselman,Jeffrey M. Nick,Steven Tuecke +3 more
- 01 Jan 2002
TL;DR: This presentation complements an earlier foundational article, “The Anatomy of the Grid,” by describing how Grid mechanisms can implement a service-oriented architecture, explaining how Grid functionality can be incorporated into a Web services framework, and illustrating how the architecture can be applied within commercial computing as a basis for distributed system integration.
The Physiology of the Grid
Ian Foster,Ian Foster,Carl Kesselman,Jeffrey M. Nick,Steven Tuecke +4 more
- 30 May 2003
TL;DR: This presentation complements an earlier foundational article, “The Anatomy of the Grid,” by describing how Grid mechanisms can implement a service-oriented architecture, explaining how Grid functionality can be incorporated into a Web services framework, and illustrating how the architecture can be applied within commercial computing as a basis for distributed system integration.
487
A Survey of Distributed Garbage Collection Techniques
David Plainfosse,Marc Shapiro +1 more
- 27 Sep 1995
TL;DR: This work describes a number of hybrid schemes improving over distributed reference counting algorithms in order to collect cyclic garbage, and describes tracing-based techniques derived from uniprocessor tracing- based techniques.
159
Garbage collecting the world
Bernard Lang,Christian Queinnec,José M. Piquer +2 more
- 01 Feb 1992
TL;DR: A new distributed GC algorithm which is fault-tolerant, largely independent of how a processor garbage collects its own data space, does not need centralized control nor global stop-the-world synchronization, allows for multiple concurrent active GCs, and eventually reclaims all inaccessible objects including distributed cycles is presented.
109
An overview of the CellML API and its implementation
Andrew K. Miller,Justin Marsh,Adam Reeve,Alan Garny,Randall Britten,Matt D. B. Halstead,Jonathan Cooper,David P. Nickerson,Poul M. F. Nielsen +8 more
TL;DR: An API which allows the information in CellML models to be retrieved and/or modified, and a series of optional extension APIs, for tasks such as simplifying the handling of connections between variables, dealing with physical units, validating models, and translating models into different procedural languages are developed.
References
On-the-fly garbage collection: an exercise in cooperation
Edsger W. Dijkstra,Leslie Lamport,Alain J. Martin,Carel S. Scholten,E. F. M. Steffens +4 more
- 23 Jul 1975
TL;DR: In this paper, a technique is developed which allows nearly all of the activity needed for garbage detection and collection to be performed by an additional processor operating concurrently with the processor devoted to the computation proper.
590
Multiprocessing compactifying garbage collection
TL;DR: Algorithms for a multiprocessing compactifying garbage collector are presented and discussed and particular attention is given to the problems of marking and relocating list cells while another processor may be operating on them.
293
A distributed garbage collection algorithm
John Hughes
- 01 Jan 1985
TL;DR: An apricot tree which bears early ripening, large, freestone fruit and which has a large spreading tree with dark green leaves having red globose glands and a lack of stipules.
108
Garbage collection and task deletion in distributed applicative processing systems
Paul Hudak,Robert M. Keller +1 more
- 15 Aug 1982
TL;DR: A real-time, effectively distributed, garbage collector of the mark-sweep variety, called the marking-tree collector, is shown to accomplish reclamation in parallel with the main computation, with no centralized data or control other than a logical rendezvous between phases of the collector.
108
An efficient parallel garbage collection system and ITS correctness proof
Hsiang-Tsung Kung,Siang Wun Song +1 more
- 30 Sep 1977
TL;DR: An efficient system to perform garbage collection in parallel with list operations is proposed and its correctness is proven and results show that the parallel system is usually significantly more efficient in terms of storage and time than the sequential stack algorithm.
108
Related Papers (5)
Paul Watson,Ian Watson +1 more
- 01 Mar 1987
Bernard Lang,Christian Queinnec,José M. Piquer +2 more
- 01 Feb 1992
John Hughes
- 01 Jan 1985
David Plainfosse,Marc Shapiro +1 more
- 27 Sep 1995