Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Using Tractable and Realistic Churn Models to Analyze Quiescence Behavior of Distributed Protocols
SRDS '08 Proceedings of the 2008 Symposium on Reliable Distributed Systems
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Implementing a Register in a Dynamic Distributed System
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Joining a Distributed Shared Memory Computation in a Dynamic Distributed System
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Joining a Distributed Shared Memory Computation in a Dynamic Distributed System
SEUS '09 Proceedings of the 7th IFIP WG 10.2 International Workshop on Software Technologies for Embedded and Ubiquitous Systems
| Hi-index | 0.00 |
This paper is on the implementation of high level communication abstractions in dynamic systems (i.e., systems where the entities can enter and leave arbitrarily). Two abstractions are investigated, namely the read/write register and add/remove/get set data structure. The paper studies the join protocol that a process has to execute when it enters the system, in order to obtain a consistent copy of the (register or set) object despite the uncertainty created by the net effect of concurrency and dynamicity. It presents two join protocols, one for each abstraction, with provable guarantees.