On the generalized dining philosophers problem
| dc.creator | Herescu, Oltea Mihaela | |
| dc.creator | Palamidessi, Catuscia | |
| dc.date | 2001-09-03 | |
| dc.date.accessioned | 2026-07-07T03:17:27Z | |
| dc.date.available | 2026-07-07T03:17:27Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/cs/0109003 | |
| dc.identifier | http://arxiv.org/abs/cs/0109003 | |
| dc.identifier | Proc. of the 20th ACM Symposium on Principles of Distributed Computing (PODC), pages 81-89, ACM, 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30729 | |
| dc.subject | Programming Languages | |
| dc.subject | D.4.1;C.2.4 | |
| dc.title | On the generalized dining philosophers problem | |
| dc.type | text |