Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Collection

Liskov, Barbara; Ladin, Rivka

doi:10.21236/ada229264

Cited by 24 publications

(30 citation statements)

References 12 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This optimization is described in [6]. In this scheme, a central map server is used to hold a copy of the map.…”

Section: Central Server Optimizationmentioning

confidence: 99%

“…To maintain the consistency of data stored at different replicas, we use a scheme based on the method described in [6]. In our implementation, it is possible to store data by communicating with any replica.…”

Section: Replication Of the Servermentioning

confidence: 99%

“…The organization of the map and generation map services is similar to that described in [6]. Client guardians communicate with the map server through an abstract data type called map-service.…”

Section: Chaptermentioning

confidence: 99%

“…In our implementation of the server, we solve these problems using the method described in [6]. First, we require that no client can insert an entry for a uid into the map after that id has been deleted.…”

Section: Removing Deleted Entriesmentioning

confidence: 99%

See 3 more Smart Citations

Central-Server-Based Orphan Detection for Argus

Markowitz¹

1990

View full text Add to dashboard Cite

“…This optimization is described in [6]. In this scheme, a central map server is used to hold a copy of the map.…”

Section: Central Server Optimizationmentioning

confidence: 99%

Section: Replication Of the Servermentioning

confidence: 99%

Section: Chaptermentioning

confidence: 99%

Section: Removing Deleted Entriesmentioning

confidence: 99%

See 2 more Smart Citations

Central-Server-Based Orphan Detection for Argus

Markowitz¹

1990

View full text Add to dashboard Cite

“…One way for the sender to refrain from sending a decrement message for a reference it sent out to another node -until it has received the ack -is to store all such references in a separate data structure, called the translist, whose entries include the receiver node to which the reference was sent. (The concept of a translist is borrowed from [LL86], where it is used in a somewhat different context.) Entries are deleted from the translist when the sender receives an ack from the receiver (or the owner, depending upon the exact protocol).…”

Section: Reference Countingmentioning

confidence: 99%

Fault-tolerant distributed garbage collection in a client-server object-oriented database

Maheshwari¹,

Liskov²

Proceedings of 3rd International Conference on Parallel and Distributed Information Systems

View full text Add to dashboard Cite

We present a design for distributed garbage collection in a new object-oriented database system called Thor. Garbage collection in Thor is different from that in conventional distributed systems because Thor has a client-server architecture, in which clients fetch copies of objects from multiple servers and run transactions. Our design accounts for the caching and prefetching of objects done by the clients. It also accounts for the distributed commit protocol, which involves the transfer of modified objects from the client cache back to the servers. The scalability of Thor precludes the use of global mechanisms. Therefore, our design is based on each server keeping a conservative record of incoming references from clients and other servers; this allows fast and fault-tolerant collection of most garbage. The performance requirement faced by the design is that it minimize the delay added to fetch and commit operations invoked by clients. We have devised techniques that eliminate major overheads when a client fetches a block of objects from a server: no extra messages need be sent, the server need not record the references contained in the objects in the block, and no stable-storage write is required. However, when a client commits a transaction, extra messages and stable-storage writes may be required for garbage collection purposes. We propose a scheme that masks the delay by performing garbage collection work in parallel with normal commit-time work. The rest of the distributed garbage collection protocol is devised so that it works in the background; the protocol uses only unreliable messages and tolerates node crashes and network partitions. Since our design is based on keeping a record of remote references, it does not collect distributed cyclic garbage. The thesis includes a discussion of various techniques that can be used to augment such a design to collect all garbage. The thesis also contains a novel analysis of a wide range of distributed garbage collection algorithms.

show abstract

Distributed Garbage Collection for Mobile Actor Systems: The Pseudo Root Approach

Wang

Varela

2006

Advances in Grid and Pervasive Computing

View full text Add to dashboard Cite

Automatic distributed garbage collection (GC) gives abstraction to grid application development, promoting code quality and improving resource management. Unreachability of active objects or actors from the root set is not a sufficient condition to collect actor garbage, making passive object GC algorithms unsafe when directly used on actor systems. In practical actor languages, all actors have references to the root set since they can interact with users, e.g., through standard input or output streams. Based on this observation, we introduce pseudo roots: a dynamic set of actors that can be viewed as the root set. Pseudo roots use protected (undeletable) references to ensure that no actors are erroneously collected even with messages in transit. Following this idea, we introduce a new direction of actor GC, and demonstrate it by developing a distributed GC framework. The framework can thus be used for automatic life time management of mobile reactive processes with unordered asynchronous communication. This report is an extended version of [42]. It provides more information about how we built a distributed garbage collector with the help of the pseudo root approach. It also shows experimental results for local GC.

show abstract

Highly-Available Distributed Services and Fault-Tolerant Distributed Garbage Collection

Cited by 24 publications

References 12 publications

Central-Server-Based Orphan Detection for Argus

Central-Server-Based Orphan Detection for Argus

Fault-tolerant distributed garbage collection in a client-server object-oriented database

Distributed Garbage Collection for Mobile Actor Systems: The Pseudo Root Approach

Contact Info

Product

Resources

About