Reaching Agreement on Processor Group Membership in Synchronous Distributed Systems (1991)
| Venue: | Distributed Computing |
| Citations: | 125 - 14 self |
BibTeX
@ARTICLE{Cristian91reachingagreement,
author = {Flaviu Cristian},
title = {Reaching Agreement on Processor Group Membership in Synchronous Distributed Systems},
journal = {Distributed Computing},
year = {1991},
volume = {4},
pages = {175--187}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Reaching agreement on the identity of correctly functioning processors of a distributed system in the presence of random communication delays, failures and processor joins is a fundamental problem in fault-tolerant distributed systems. Assuming a synchronous communication network that is not subject to partition occurrences, we specify the processor-group membership problem and we propose three simple protocols for solving it. The protocols provide all correct processors with consistent views of the processor-group membership and guarantee bounded processor failure detection and join delays. Key words: Communication network -- Distributed system -- Failure detection -- Fault tolerance -- Real time system -- Replicated data 1 Introduction When designing a computing service that must remain available despite component failures, a key idea is to replicate service state information at several servers running on distinct processors. The service state typically consists of the ser...
