Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
