Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Dining philosophers problem

Known as: Five philosophers, Dining philosophers, Drinking philosophers 
In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization… Expand
Wikipedia

Related topics

Related topics

17 relations
Algebraic Petri netAlgorithmCigarette smokers problemComputer science
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Bounded synthesis
A fundamental challenge in the synthesis of reactive systems is the size of the search space: the number of candidate… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
2011
Highly Cited
2011
If money doesn't make you happy, then you probably aren't spending it right
Abstract The relationship between money and happiness is surprisingly weak, which may stem in part from the way people spend it… Expand
  • figure 1
Is this relevant?
2006
2006
The Dining Philosophers Problem Revisited
We present an alternative solution to the Dining Philosophers problem that is based on Peterson’s mutual exclusion algorithm for… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstraction, Refinement and Proof for Probabilistic Systems
Probabilistic guarded commands and their refinement logic.- to pGCL: Its logic and its model.- Probabilistic loops: Invariants… Expand
Is this relevant?
2001
2001
On the generalized dining philosophers problem
We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully… Expand
  • table 2
  • figure 3
Is this relevant?
1992
1992
The dining philosophers problem and its decentralisation
  • J. G. Vaughan
  • Microprocess. Microprogramming
  • 1992
    • Corpus ID: 39086700
Abstract This paper deals with resource contention in a distributed system, using the dining philosophers problem as a system… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A dining philosophers algorithm with polynomial response time
Presents an efficient distributed online algorithm for scheduling jobs that are created dynamically, subject to resource… Expand
  • figure 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A Generalized Timed Petri Net Model for Performance Analysis
We have developed a Generalized Timed Petri Net (GTPN) model for evaluating the performance of computer systems. Our model is a… Expand
  • figure 1
  • figure 3
  • table I
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The drinking philosophers problem
The problem of resolving conflicts between processes in distributed systems is of practical importance. A conflict between a set… Expand
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem
It is shown that distributed systems of probabilistic processors are essentially more powerful than distributed systems of… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE