A calculus of mobile processes, II
Information and Computation
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Mobile calculi for distributed programming
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
| Hi-index | 0.00 |
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.