On the generalized dining philosophers problem
<|reference_start|>On the generalized dining philosophers problem: 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.<|reference_end|>
@article{herescu2001on,
    title={On the generalized dining philosophers problem},
    author={Oltea Mihaela Herescu and Catuscia Palamidessi},
    journal={Proc. of the 20th ACM Symposium on Principles of Distributed
  Computing (PODC), pages 81-89, ACM, 2001},
    year={2001},
    archivePrefix={arXiv},
    eprint={cs/0109003},
    primaryClass={cs.PL}
}