The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Self-stabilization
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.89 |
We present a self-stabilizing solution to a new version of the dining philosophers problem. We call this problem mobile philosophers problem because the philosophers can move around a logical ring formed out of a dynamic network.