Verification of multiprocess probabilistic protocols
Distributed Computing
Proving time bounds for randomized distributed algorithms
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Formal verification of timed properties of randomized distributed algorithms
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Uniform and Self-Stabilizing Token Rings Allowing Unfair Daemon
IEEE Transactions on Parallel and Distributed Systems
Memory space requirements for self-stabilizing leader election protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Distributed Algorithms
Token-based self-stabilizing uniform algorithms
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Randomized Finite-State Distributed Algorithms as Markov Chains
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
The probabilistic asynchronous pi-calculus
The probabilistic asynchronous pi-calculus
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
Categorial semantics of a solution to distributed dining philosophers problem
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
| Hi-index | 0.00 |
We consider Lehmann-Rabin's randomized solution to the well-known problem of the dining philosophers. Up to now, such an analysis has always required a "fairness" assumption on the scheduling mechanism: if a philosopher is continuously hungry then he must eventually be scheduled. In contrast, we modify here the algorithm in order to get rid of the fairness assumption, and we claim that the spirit of the original algorithm is preserved. We prove that, for any (possibly unfair) scheduling, the modified algorithm converges: every computation reaches with probability 1 a configuration where some philosopher eats. Furthermore, we are now able to evaluate the expected time of convergence in terms of the number of transitions. We show that, for some "malicious" scheduling, this expected time is at least exponential in the number N of philosophers.