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
Elements of network protocol design
Elements of network protocol design
Information Processing Letters
Self-stabilization
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
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
ICDCS '99 Workshop on Self-stabilizing Systems
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
Unifying stabilization and termination in message-passing systems
Distributed Computing
Stabilizing mobile philosophers
Information Processing Letters
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
Distance-k information in self-stabilizing algorithms
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Distance- k knowledge in self-stabilizing algorithms
Theoretical Computer Science
On bootstrapping topology knowledge in anonymous networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A Distributed and Deterministic TDMA Algorithm for Write-All-With-Collision Model
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
A Self-stabilizing $\frac{2}{3}$-Approximation Algorithm for the Maximum Matching Problem
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Separation of Circulating Tokens
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Algorithms and theory of computation handbook
A self-stabilizing 23-approximation algorithm for the maximum matching problem
Theoretical Computer Science
| 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 -- KDP that solves a restricted version of the generalized problem where the conflict set for each process is limited to its k-hop neighborhood. Our algorithm is terminating. We formally prove KDP correct and evaluate its performance. We then extend KDP to handle fully generalized problem.We further extend it to handle a similarly generalized drinking philosophers problem. We describe how KDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties.