A modular drinking philosophers algorithm

DOI10.1007/BF02242711MaRDI QIDQ1261112zbMATH OpenOpenAlexFDO

Authors Jennifer L. Welch, Nancy Lynch

Publication date 16 September 1993

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02242711

zbMATH Keywords

allocationconcurrencydining philosophersdrinking philosophers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 4064453
• A priority dynamics for generalized drinking philosophers
• An optimal distributed solution to the dining philosphers problem
• On the generalized dining philosophers problem
• Randomized dining philosophers without fairness assumption

Cites work

• scientific article; zbMATH DE number 4064453 (Why is no real title available?)
• Rankers: A classification of synchronization problems
• Upper bounds for static resource allocation in a distributed system

Cited in

(5)

• A priority dynamics for generalized drinking philosophers
• Dynamic input/output automata: a formal and compositional model for dynamic systems
• From drinking philosophers to asynchronous path-following robots
• A distributed resource allocation algorithm for many processes
• scientific article; zbMATH DE number 4064453 (Why is no real title available?)

This page was built for publication: A modular drinking philosophers algorithm

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