منابع مشابه
The Weakest Failure Detector for Consensus * Solving
We determine what information about failures is necessary and sufficient to solve Consensus in asynchronous distributed systems subject to crash failures. In [CT91], we proved that <>IV, a failure detector that provides surprisingly little information about which processes have crashed, is sufficient to solve Consensus in asynchronous systems with a majority of correct processes. In this paper,...
متن کاملOn the Weakest Failure Detector for Non-Blocking Atomic Commit
This paper addresses the question of the weakest failure detector to solve the Non-Blocking Atomic Commit (NBAC) problem in an asynchronous system. We define the set A of timeless failure detectors which excludes failure detectors that provide information about global time but includes all known meaningful failure detectors such as 3S , 3P and P [2]. We show that, within A, the weakest failure ...
متن کاملOn the Weakest Failure Detector for Quiescent Reliable Communication
We consider the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links, and show that, among failure detectors with bounded output size, P is the weakest one that can be used to solve this problem. Combined with a result in [ACT97], this shows that failure detecto...
متن کاملOn the Weakest Failure Detector for Uniform Reliable Broadcast∗
Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent PODC paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit ...
متن کاملRevising the Weakest Failure Detector for Uniform Reliable Broadcast
Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2009
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-009-0079-3