The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Parallel program design: a foundation
Parallel program design: a foundation
Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Adaptivity through distributed convergence
Adaptivity through distributed convergence
Elements of network protocol design
Elements of network protocol design
Information Processing Letters
A self-stabilizing distributed algorithm to find the median of a tree graph
Journal of Computer and System Sciences
Self-stabilization
Scalable queue-based spin locks with timeout
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
Stabilization-preserving atomicity refinement
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Self-Stabilizing Local Mutual Exclusion and Daemon Refinement
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
ICDCS '99 Workshop on Self-stabilizing Systems
Fast allocation of nearby resources in a distributed system
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Dining Philosophers that Tolerate Malicious Crashes
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Adaptive and efficient abortable mutual exclusion
Proceedings of the twenty-second annual symposium on Principles of distributed computing
When graph theory helps self-stabilization
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Location Estimation in Ad Hoc Networks with Directional Antennas
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
Stabilizing mobile philosophers
Information Processing Letters
Unifying stabilization and termination in message-passing systems
Distributed Computing
Fast Convergence in Self-Stabilizing Wireless Networks
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Conflict Managers for Self-stabilization without Fairness Assumption
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Collision-free communication in sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Self-stabilizing atomicity refinement allowing neighborhood concurrency
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
An improved snap-stabilizing PIF algorithm
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Distance-k information in self-stabilizing algorithms
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
A tranformational approach for designing scheduler-oblivious self-stabilizing algorithms
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.00 |
We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is motivated by a number of practical problems in distributed systems including problems in wireless sensor networks. We present a self-stabilizing deterministic algorithm—GDP that solves this generalized problem. Our algorithm is terminating. We formally prove GDP correct and evaluate its performance. We extend the algorithm to handle a similarly generalized drinking philosophers and the committee coordination problem. We describe how GDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties.