On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion

Failure detectors are devices (objects) that provides the processes with information on failures. They were introduced to enrich asynchronous systems so that it becomes possible to solve problems (or implement concurrent objects) that are otherwise impossible to solve in pure asynchronous systems where processes are prone to crash failures. The most famous failure detector (which is called “eventual leader” and denoted \(\varOmega \)) is the weakest failure detector which allows consensus to be solved in n-process asynchronous systems where up to \(t=n-1\) processes may crash in the read/write communication model, and up to \(t

[1]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

[2]  Gadi Taubenfeld.  Synchronization Algorithms and Concurrent Programming , 2006 .

[3]  Santosh S. Vempala,et al.  A random-sampling-based algorithm for learning intersections of halfspaces , 2010, JACM.

[4]  Michel Raynal,et al.  A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems , 2007, 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07).

[5]  Achour Mostéfaoui,et al.  Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors , 2000, IEEE Trans. Parallel Distributed Syst..

[6]  Rachid Guerraoui,et al.  Tight failure detection bounds on atomic object implementations , 2010, JACM.

[7]  Rachid Guerraoui,et al.  A realistic look at failure detectors , 2002, Proceedings International Conference on Dependable Systems and Networks.

[8]  Carole Delporte-Gallet,et al.  Fair Synchronization in the Presence of Process Crashes and its Weakest Failure Detector , 2014, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems.

[9]  Michel Raynal,et al.  Fault-Tolerant Message-Passing Distributed Systems , 2018, Springer International Publishing.

[10]  Prasad Jayanti,et al.  On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion , 2009, DISC.

[11]  Rachid Guerraoui,et al.  The weakest failure detectors to solve certain fundamental problems in distributed computing , 2004, PODC '04.

[12]  Prasad Jayanti,et al.  Extracting quorum failure detectors , 2009, PODC '09.

[13]  Michel Raynal,et al.  A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems , 2010, Inf. Process. Lett..

[14]  Rachid Guerraoui,et al.  Mutual exclusion in asynchronous systems with failure detectors , 2005, J. Parallel Distributed Comput..

[15]  Michel Raynal.  A Few Definitions and Two Introductory Examples , 2018 .

[16]  Vassos Hadzilacos,et al.  Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract) , 1994, WDAG.

[17]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[18]  Leslie Lamport,et al.  A new solution of Dijkstra's concurrent programming problem , 1974, Commun. ACM.

[19]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

[20]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[21]  Michel Raynal,et al.  Concurrent Programming: Algorithms, Principles, and Foundations , 2012, Springer Berlin Heidelberg.