Randomized dining philosophers without fairness assumption

DOI10.1007/978-0-387-35608-2_15MaRDI QIDQ5138505zbMATH OpenOpenAlexFDO

Authors Marie Duflot, Claudine Picaronny, Laurent Fribourg

Publication date 4 December 2020

Published in Foundations of Information Technology in the Era of Network and Mobile Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-0-387-35608-2_15

zbMATH Keywords

dining philosophersscheduling mechanismfairness assumption

Mathematics Subject Classification ID

Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Recommendations

• On the generalized dining philosophers problem
• scientific article; zbMATH DE number 4064453
• Wait-Free Dining Under Eventual Weak Exclusion
• scientific article; zbMATH DE number 3846854
• Randomized mutual exclusion algorithms revisited

Cites work

• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 2006656 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (Why is no real title available?)
• scientific article; zbMATH DE number 3240812 (Why is no real title available?)
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Formal verification of timed properties of randomized distributed algorithms
• Memory space requirements for self-stabilizing leader election protocols
• Proving time bounds for randomized distributed algorithms
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Token-based self-stabilizing uniform algorithms
• Verification of multiprocess probabilistic protocols

Cited in

(7)

• The philosophers' process: An ergodic reversible nearest particle system
• A modular drinking philosophers algorithm
• A randomized encoding of the \(\pi\)-calculus with mixed choice
• Fast and fair randomized wait-free locks
• Stability of dining clubs in the Kolkata paise restaurant problem with and without cheating
• Wait-Free Dining Under Eventual Weak Exclusion
• On the generalized dining philosophers problem

This page was built for publication: Randomized dining philosophers without fairness assumption

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