Loading...
Please wait, while we are loading the content...
Similar Documents
On the Generalized Dining Philosophers Problem (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Mihaela, Oltea Palamidessi, Herescu Catuscia Herescu, Oltea Mihaela Palamidessi, Catuscia |
| Abstract | We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We show that the well-known algorithms of Lehmann and Rabin do not work in the generalized case, and we propose an alternative algorithm based on the idea of letting the philosophers assign a random priority to their adjacent forks. |
| File Format | |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Adjacent Fork Random Priority Alternative Algorithm Adversary Scheduler Generalized Dining Philosopher Problem Generalized Case Well-known Algorithm Philosopher Problem Arbitrary Connection Topology |
| Content Type | Text |
