Wait-Free Dining Under Eventual Weak Exclusion

We present a wait-free solution to the generalized dining philosophers problem under eventual weak exclusion in environments subject to crash faults. Wait-free dining guarantees that every correct hungry process eventually eats, regardless of process crashes. Eventual weak exclusion (◊WX) actually allows scheduling mistakes, whereby mutual exclusion may be violated finitely-many times; for each run, however, there must exist a convergence point after which live neighbors never eat simultaneously. Wait-free dining under ◊WX is particularly useful for synchronization tasks where eventual safety is sufficient for correctness (e.g., duty-cycle scheduling, self-stabilizing daemons, and contention managers). Unfortunately, wait-free dining is unsolvable in asynchronous systems. As such, we characterize sufficient conditions for solvability under partial synchrony by presenting a wait-free dining algorithm for ◊WX using a local refinement of the eventually perfect failure detector ◊P1.

[1]  Nancy A. Lynch,et al.  Fast allocation of nearby resources in a distributed system , 1980, STOC '80.

[2]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[3]  Nancy A. Lynch,et al.  Consensus in the presence of partial synchrony , 1988, JACM.

[4]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[5]  Flaviu Cristian,et al.  Understanding fault-tolerant distributed systems , 1991, CACM.

[6]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[7]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[8]  \??accurate" Failure Detectors , 1996 .

[9]  Rachid Guerraoui,et al.  "Gamma-Accurate" Failure Detectors , 1996, WDAG.

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

[11]  Ozalp Babaoglu,et al.  Distributed algorithms : 10th International Workshop, WDAG '96, Bologna, Italy, October 9-11, 1996 : proceedings , 1996 .

[12]  Joffroy Beauquier,et al.  Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors , 1997, Int. J. Syst. Sci..

[13]  Michel Raynal,et al.  Restricted failure detectors: Definition and reduction protocols , 1999, Inf. Process. Lett..

[14]  Ajoy Kumar Datta,et al.  Self-Stabilizing Local Mutual Exclusion and Daemon Refinement , 2000, Chic. J. Theor. Comput. Sci..

[15]  Anish Arora,et al.  Stabilization-Preserving Atomicity Refinement , 2002, J. Parallel Distributed Comput..

[16]  A necessary and sufficient condition for transforming limited accuracy failure detectors , 2004, J. Comput. Syst. Sci..

[17]  Paolo A. G. Sivilotti,et al.  Dining philosophers with crash locality 1 , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[18]  Shlomi Dolev,et al.  Self Stabilization , 2004, J. Aerosp. Comput. Inf. Commun..

[19]  Paolo A. G. Sivilotti,et al.  Distributed resource allocation with scalable crash containment , 2004 .

[20]  Edsger W. Dijkstra,et al.  Hierarchical ordering of sequential processes , 1971, Acta Informatica.

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

[22]  Josef Widder,et al.  Self-Stabilizing Failure Detector Algorithms , 2005, Parallel and Distributed Computing and Networks.

[23]  Christof Fetzer,et al.  On the Possibility of Consensus in Asynchronous Systems with Finite Average Response Times , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[24]  Maria Gradinariu Potop-Butucaru,et al.  Conflict Managers for Self-stabilization without Fairness Assumption , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[25]  Srikanth Sastry,et al.  Eventually Perfect Failure Detectors Using ADD Channels , 2007, ISPA.

[26]  S. M. Pike,et al.  Eventually k-Bounded Wait-Free Distributed Daemons , 2007, 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN'07).

[27]  Rachid Guerraoui,et al.  The weakest failure detectors to boost obstruction-freedom , 2006, Distributed Computing.