Brief announcement: wait-free dining for eventual weak exclusion

Authors:
Scott M. Pike;Yantao Song;Kaustav Ghoshal
Affiliations:
Texas A&M University, Department of Computer Science, College Station, TX;Texas A&M University, Department of Computer Science, College Station, TX;Texas A&M University, Department of Computer Science, College Station, TX
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 5
Cited 0

Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Localizing Failures in Distributed Synchronization

IEEE Transactions on Parallel and Distributed Systems
Stabilization-preserving atomicity refinement

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Fast allocation of nearby resources in a distributed system

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Dining Philosophers with Crash Locality 1

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present the first wait-free solution to dining philosophers under eventual weak exclusion in partially synchronous environments subject to crash faults. Potential applications include distributed daemon refinement for self-stabilizing algorithms.