JavaScript is disabled for your browser. Some features of this site may not work without it.
On the Weakest Failure Detector for Quiescent Reliable Communication

Author
Aguilera, Marcos Kawazoe; Chen, Wei; Toueg, Sam
Abstract
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, less than or greater than P is the weakest one that can be used to solve this problem. Combined with a result in [ACT97a], this shows that failure detectors that are commonly used in practice, i.e., those that output lists of suspects, are not always the best ones to solve a problem.
Date Issued
1997-07Publisher
Cornell University
Subject
computer science; technical report
Previously Published As
http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR97-1640
Type
technical report