Wait-Free Dining Under Eventual Weak Exclusion

DOI10.1007/978-3-540-77444-0_11MaRDI QIDQ5445745zbMATH OpenOpenAlexFDO

Authors Scott M. Pike, Yantao Song, Srikanth Sastry

Publication date 6 March 2008

Published in Distributed Computing and Networking (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77444-0_11

zbMATH Keywords

Dining PhilosophersFailure DetectorsWait-Freedom

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On the generalized dining philosophers problem
• Randomized dining philosophers without fairness assumption
• The mutual exclusion problem
• The mutual exclusion problem: part II---Statement and solutions
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion

Cites work

• A necessary and sufficient condition for transforming limited accuracy failure detectors
• Eventually Perfect Failure Detectors Using ADD Channels
• Fault-tolerance and self-stabilization: impossibility results and solutions using self-stabilizing failure detectors
• Mutual exclusion in asynchronous systems with failure detectors
• On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
• Restricted failure detectors: Definition and reduction protocols
• The Weakest Failure Detectors to Boost Obstruction-Freedom
• Unreliable failure detectors for reliable distributed systems

Cited in

(3)

• Failure detectors encapsulate fairness
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• Randomized dining philosophers without fairness assumption

This page was built for publication: Wait-Free Dining Under Eventual Weak Exclusion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445745)