Thumbnail
Access Restriction
Subscribed

Author Freiling, Felix C. ♦ Guerraoui, Rachid ♦ Kuznetsov, Petr
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2011
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Distributed system ♦ Agreement problem ♦ Atomic commit ♦ Consensus ♦ Fault tolerance ♦ Liveness ♦ Message passing ♦ Safety ♦ Synchrony
Abstract A failure detector is a fundamental abstraction in distributed computing. This article surveys this abstraction through two dimensions. First we study failure detectors as building blocks to simplify the design of reliable distributed algorithms. In particular, we illustrate how failure detectors can factor out timing assumptions to detect failures in distributed agreement algorithms. Second, we study failure detectors as computability benchmarks. That is, we survey the weakest failure detector question and illustrate how failure detectors can be used to classify problems. We also highlight some limitations of the failure detector abstraction along each of the dimensions.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2011-02-04
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 43
Issue Number 2
Page Count 40
Starting Page 1
Ending Page 40


Open content in new tab

   Open content in new tab
Source: ACM Digital Library