Robust, distributed references and acyclic garbage collection
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Subcontract: a flexible base for distributed programming
SOSP '93 Proceedings of the fourteenth ACM symposium on Operating systems principles
Replication management using the state-machine approach
Distributed systems (2nd Ed.)
Distributed systems (2nd Ed.)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Fault-tolerant distributed garbage collection in a client-server object-oriented database
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
A Survey of Distributed Garbage Collection Techniques
IWMM '95 Proceedings of the International Workshop on Memory Management
Uniprocessor Garbage Collection Techniques
IWMM '92 Proceedings of the International Workshop on Memory Management
A Cyclic Distributed Garbage Collector for Network Objects
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
High Availability Support in CORBA Environments
SOFSEM '97 Proceedings of the 24th Seminar on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
ROI: An Invocation Mechanism for Replicated Objects
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Solaris MC: a multi computer OS
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
Implementing Fault-Tolerant Distributed Objects
IEEE Transactions on Software Engineering
HMM: A Cluster Membership Service
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
| Hi-index | 0.00 |
This paper describes the Hidra garbage collection system for non-migratable singleton objects, migratable objects and replicated objects. Garbage detection is based on a distributed reference counting protocol and on the use of forwarders when migration occurs. The algorithm is triggered by object reference operations and is completely asynchronous, enabling techniques such as piggy-backing and batching of messages. Once some object is computed as garbage, the ORB sends an unreferenced notification to its implementation. In the case of replicated objects, the unreferenced notification is asynchronously delivered to every replica implementation. The algorithm is safe and live in the absence of failures. When failures arise a reference count reconstruction protocol reestablishes the garbage detection algorithm invariants.