New latency bounds for atomic broadcast
Ray Strong, Danny Dolev, et al.
RTSS 1990
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. © 1991 Springer-Verlag.
Ray Strong, Danny Dolev, et al.
RTSS 1990
Flaviu Cristian
IEEE Transactions on Software Engineering
Flaviu Cristian, Bob Dancey, et al.
EW 1990
Flaviu Cristian
IEEE Transactions on Software Engineering