Wait-Free Dining Under Eventual Weak Exclusion

DOI10.1007/978-3-540-77444-0_11zbMath1131.68343OpenAlexW2099752472MaRDI QIDQ5445745

Scott M. Pike, Srikanth Sastry, Yantao Song

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

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

Related Items (2)

An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values ⋮ Failure detectors encapsulate fairness

Cites Work

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

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