Agreeing on who is present and who is absent in a synchronousdistributed system
Cristian, F.
IBM Almaden Res. Center, San Jose, CA;
This paper appears in: Fault-Tolerant Computing, 1988. FTCS-18, Digest of Papers., Eighteenth International Symposium on
Publication Date: 27-30 Jun 1988
On page(s): 206-211
Meeting Date: 06/27/1988 - 06/30/1988
Location: Tokyo, Japan
ISBN: 0-8186-0867-6
References Cited: 13
INSPEC Accession Number: 3247935
Digital Object Identifier: 10.1109/FTCS.1988.5321
Current Version Published: 2002-08-06
Abstract
The author describes his system model and failure assumptions by
precisely specifying the processor group membership problem. He then
gives two protocols for solving this problem. The protocols provide all
correct processors with constituent views of the processor group
membership. They also guarantee bounded processor failure detection and
join processing delays despite any number of performance failures that
do not cause network partitioning. The first protocol provides very fast
processor failure detection but can require a significant message
traffic overhead, even when no failures occur. To reduce this overhead,
the author derives the second protocol, which has a (provable) minimal
message overhead in the absence of failures but provides a longer
failure detection delay and is more complex. He concludes by comparing
his approach with other known approaches
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
