Skip to main content
Kent Academic Repository

A Cyclic Distributed Garbage Collector for Network Objects

Rodrigues, Helena C.C.D. and Jones, Richard E. (1996) A Cyclic Distributed Garbage Collector for Network Objects. In: Babaoglu, Ö. and Marzullo, K., eds. Distributed Algorithms 10th International Workshop. Lecture Notes in Computer Science . Springer, Berlin, Germany, pp. 123-140. ISBN 978-3-540-61769-3. E-ISBN 978-3-540-70679-3. (doi:10.1007/3-540-61769-8_9) (KAR id:21327)


This paper presents an 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. Processes may be dynamically organised into groups, according to appropriate heuristics, to reclaim distributed garbage cycles. 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. The algorithm offers considerable flexibility, allowing expediency and fault-tolerance to be traded against completeness.

Item Type: Book section
DOI/Identification number: 10.1007/3-540-61769-8_9
Uncontrolled keywords: distributed systems, termination detection, fault tolerance, garbage collection, algorithms,
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: 26 Aug 2009 18:18 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.