Thumbnail
Access Restriction
Subscribed

Author Chandra, Tushar Deepak ♦ Toueg, Sam
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1996
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Byzantine Generals' problem ♦ Agreement problem ♦ Asynchronous systems ♦ Atomic broadcast ♦ Commit problem ♦ Consensus problem ♦ Crash failures ♦ Failure detection ♦ Fault-tolerance ♦ Message passing ♦ Partial synchrony ♦ Processor failures
Abstract We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in asynchronous systems with crash failures. We characterise unreliable failure detectors in terms of two properties—completeness and accuracy. We show that Consensus can be solved even with unreliable failure detectors that make an infinite number of mistakes, and determine which ones can be used to solve Consensus despite any number of crashes, and which ones require a majority of correct processes. We prove that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast. A companion paper shows that one of the failure detectors introduced here is the weakest failure detector for solving Consensus [Chandra et al. 1992].
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1996-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 43
Issue Number 2
Page Count 43
Starting Page 225
Ending Page 267


Open content in new tab

   Open content in new tab
Source: ACM Digital Library