The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Token Systems That Self-Stabilize
IEEE Transactions on Computers
Self-stabilizing systems in spite of distributed control
Communications of the ACM
ICDCS '99 Workshop on Self-stabilizing Systems
Lock-based self-stabilizing distributed mutual exclusion algorithms
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Self-Stabilizing Agent Traversal
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Easy Stabilization with an Agent
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Local Synchronization on Oriented Rings
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
Consider a network of nodes: each node represents a philosopher: links represent the neighboring relationship among tile philosophers, Every philosopher enjoys singing so much that once getting the chance, he always sings a song within a finite delay. Fhis paper proposes a protocol for the philosophers to follow. Fhe protocol guarantees the following requirements: (1) No two neighboring philosophers sing songs simultaneously. (2) Along any infinite time period, each philosopher gets his chances to sing infinitely often. Following tile protocol, each philosopher uses only one bit to memorize his state.Sometimes tile philosophers may be fuzzy enough to forget tile state. So, a self-stabili ing vesion of the protocol is also proposed to cope with this problem, However, the philosophers may need additional bits to memorize their states.