Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th 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
Geo-registers: An Abstraction for Spatial-Based Distributed Computing
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Implementing a Register in a Dynamic Distributed System
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Multiwriter Consistency Conditions for Shared Memory Registers
SIAM Journal on Computing
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Looking for a definition of dynamic distributed systems
PaCT'07 Proceedings of the 9th international conference on Parallel Computing Technologies
Quorum-based dynamic regular registers in systems with churn
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Dynamic regular registers in systems with churn
Theoretical Computer Science
| Hi-index | 0.00 |
Distributed systems with churn, or dynamic distributed systems, allow the processes to join and leave the system at will. In this paper, we present a new consistency condition for shared read-write registers which is based on multi-writer regularity, but allows for the likelihood of the register to lose its state with some probability; we call this a dynamic regular register. We then describe an algorithm for implementing a dynamic regular register using copies of the register distributed among the processes. When a process joins the system, it attempts to obtain an up-to-date copy of the data from other processes. Copies of the register are updated by broadcasting information. To model the dynamicity of the system with churn, we use a continuous-time birth-death process which is a special case of continuous-time Markov processes. Then, we analyze the probability and the time duration that the dynamic regular register system keeps its state, given the joining rate and the leaving rate of the processes.