NDLI: Failure detectors encapsulate fairness

Content Provider	Springer Nature Link
Author	Pike, Scott M. Sastry, Srikanth Welch, Jennifer L.
Copyright Year	2012
Abstract	Failure detectors have long been 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 failure detectors 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 system models’ to implement the canonical failure detectors from the Chandra-Toueg hierarchy. We also propose a set of fairness-based models which encapsulate the $${\mathcal{G}_c}$$ parametric failure detectors which eventually and permanently suspect crashed processes, and eventually and permanently trust some fixed set of c correct processes.
Starting Page	313
Ending Page	333
Page Count	21
File Format	PDF
ISSN	01782770
Journal	Distributed Computing
Volume Number	25
Issue Number	4
e-ISSN	14320452
Language	English
Publisher	Springer-Verlag
Publisher Date	2012-02-22
Publisher Place	Berlin/Heidelberg
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Failure detectors Partial synchrony Fairness Crash faults Fault tolerance Schedulers Computer Systems Organization and Communication Networks Computer Hardware Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Computational Theory and Mathematics Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Transient fault detectors

Anonymous asynchronous systems: the case of failure detectors

The weakest failure detector to solve nonuniform consensus

Consensus and collision detectors in radio networks

Partial synchrony based on set timeliness

Failure detectors as type boosters

Fault tolerance in distributed systems using fused state machines

The minimum information about failures for solving non-local tasks in message-passing systems

Rambo: a robust, reconfigurable atomic memory service for dynamic networks

Failure detectors encapsulate fairness

Similar Documents

Transient fault detectors

Anonymous asynchronous systems: the case of failure detectors

The weakest failure detector to solve nonuniform consensus

Consensus and collision detectors in radio networks

Partial synchrony based on set timeliness

Failure detectors as type boosters

Fault tolerance in distributed systems using fused state machines

The minimum information about failures for solving non-local tasks in message-passing systems

Rambo: a robust, reconfigurable atomic memory service for dynamic networks

Failure detectors encapsulate fairness