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:
  • OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsulated by a given failure detector have met with limited success. The reason for this is that traditionally, models of partial synchrony are specified with respect to real time, but failure detectors do not encapsulate real time. Instead, we argue that failure detectors encapsulate the fairness in computation and communication. Fairness is a measure of the number of steps executed by one process relative either to the number of steps taken by another process or relative to the duration for which a message is in transit. We argue that oracles are substitutable for the fairness properties (rather than real-time properties) of partially synchronous systems. We propose four fairness-based models of partial synchrony and demonstrate that they are, in fact, the 'weakest systems models' to implement the canonical failure detectors from the Chandra-Toueg hierarchy.