Skip to main content
Kent Academic Repository

Cyclic Distributed Garbage Collection with Group Merger

Rodrigues, Helena C.C.D. and Jones, Richard E. (1997) Cyclic Distributed Garbage Collection with Group Merger. Technical report. University of Kent at Canterbury 17-97. (doi:17-97) (KAR id:21429)


This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference listing scheme, which is augmented by partial tracing in order to collect distributed garbage cycles. Our collector is designed to be flexible, allowing efficiency, expediency and fault-tolerance to be traded against completeness. Processes may be dynamically organised into groups, according to appropriate heuristics, in order to reclaim distributed garbage cycles. Unlike previous group-based algorithms, multiple concurrent distributed garbage collections that span groups are supported: when two collection meet they may either merge, overlap or retreat. The algorithm places no overhead on local collectors and suspends local mutators only briefly. Partial tracing of the distributed graph involves only objects thought to be part of a garbage cycle: no collaboration with other processes is required.

Item Type: Reports and Papers (Technical report)
DOI/Identification number: 17-97
Uncontrolled keywords: distributed systems, garbage collection, algorithms, termination detection, fault tolerance
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Richard Jones
Date Deposited: 02 Aug 2009 23:01 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.