A modular drinking philosophers algorithm

DOI10.1007/BF02242711zbMath0786.68040OpenAlexW2079361288MaRDI QIDQ1261112

Jennifer Lundelius Welch, Nancy A. 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

concurrencyallocationdining 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)

Related Items (4)

Dynamic input/output automata: a formal and compositional model for dynamic systems ⋮ A distributed resource allocation algorithm for many processes ⋮ From drinking philosophers to asynchronous path-following robots ⋮ A priority dynamics for generalized drinking philosophers

Cites Work

• Unnamed Item
• Upper bounds for static resource allocation in a distributed system
• Rankers: A classification of synchronization problems

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