Brief announcement: failure detectors encapsulate fairness

Authors:
Scott M. Pike;Srikanth Sastry;Jennifer L. Welch
Affiliations:
Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX;Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX;Dept. of Computer Science and Engineering, Texas A&M University, College Station, TX
Venue:
DISC'10 Proceedings of the 24th international conference on Distributed computing
Year:
2010

Citing 4
Cited 0

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Synchronous System and Perfect Failure Detector: Solvability and Efficiency Issue

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
The Iterated Restricted Immediate Snapshot Model

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fairness is a measure of the number of steps a process takes relative to other processes and/or messages in transit. We argue that failure detectors encapsulate fairness. As evidence, we specify models for fairness-based message-passing systems that are the weakest to implement the Chandra-Toueg failure detectors from [1].