The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Computing with Infinitely Many Processes
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts
FTCS '97 Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS '97)
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
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
Validity bound of regular registers with churn and byzantine processes
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Dynamic regular registers in systems with churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed 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
| Hi-index | 0.00 |
We consider a quorum-based implementation of the dynamic regular register system, in which the set of servers that implement the shared register is prone to churn, i.e., the register servers join and leave the register system at will. Thus, the number of servers can change dynamically and accordingly, the quorum size changes over time. We give algorithms that implement join, leave, read and write operations that preserve the quorum intersection property despite the server churn. Furthermore, we give a probabilistic analysis of the churn behavior of the dynamic register system.