You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Dave Parker
8f8565a579
|
19 years ago | |
|---|---|---|
| .. | ||
| README | 20 years ago | |
| auto | 20 years ago | |
| phil-nofair3.nm | 20 years ago | |
| phil-nofair4.nm | 20 years ago | |
| phil-nofair5.nm | 20 years ago | |
| phil-nofair6.nm | 20 years ago | |
| phil-nofair7.nm | 20 years ago | |
| phil-nofair8.nm | 20 years ago | |
| phil-nofair9.nm | 20 years ago | |
| phil-nofair10.nm | 20 years ago | |
| phil3.pctl | 20 years ago | |
| phil4.pctl | 20 years ago | |
| phil5.pctl | 20 years ago | |
| phil6.pctl | 20 years ago | |
| phil7.pctl | 20 years ago | |
| phil8.pctl | 20 years ago | |
| phil9.pctl | 20 years ago | |
README
This case study is based on Lehmann and Rabin's solution to the well known dining philosophers problem [LR81].
It considers the version presented in [DFP04] which removes the need to consider 'fairness' assumptions on the scheduling mechanism.
For more information, see: http://www.cs.bham.ac.uk/~dxp/prism/casestudies/phil.html
=====================================================================================
[LR81]
D. Lehmann and M. Rabin
On the Advantages of Free Choice: A Symmetric Fully Distributed Solution to the Dining Philosophers Problem (Extended Abstract)
In Proc. 8th Symposium on Principles of Programming Languages, pp. 133-138, 1981
[DFP04]
M. Duflot, L. Fribourg and C. Picaronny
Randomized dining philosophers without fairness assumption
Distributed Computing, 17(1):65-76, 2004