Stabilizing Communication Protocols
IEEE Transactions on Computers - Special issue on protocol engineering
Memory requirements for silent stabilization
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The complexity of crash failures
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
On concurrent programming
Information Processing Letters
Self-stabilization
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
IEEE Transactions on Computers
Finite-state self-stabilizing protocols in message-passing systems
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
Self-stabilization over unreliable communication media
Distributed Computing - Special issue: Self-stabilization
An optimal snap-stabilizing wave algorithm in arbitrary graphs
Computer Communications
Self-stabilizing philosophers with generic conflicts
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Self-stabilizing philosophers with generic conflicts
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Spanders: distributed spanning expanders
Proceedings of the 2010 ACM Symposium on Applied Computing
Stabilization in dynamic systems with varying equilibrium
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Snap-stabilization in message-passing systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
The paper dispels the myth that it is impossible for a message-passing program to be both terminating and stabilizing. We consider a rather general notion of termination: a terminating program eventually stops its execution after the environment ceases lo provide input. We identify termination-symmetry to be a necessary condition for a problem to admit a sollution with such properties. Our results do confirm that a number of well-known problems (e.g., consensus, leader election) do not allow a terminating and stabilizing solution. On the flip side, they show that other problems such as mutual exclusion and reliable-transmission allow such solutions. We present a message-passing solution to the mutual exclusion problem that is both stabilizing and terminating. We also desctibe an approach of adding termination to a stabilizing program. To illustrate this approach, we add termination to a stabilizing solution for the reliable transmission problem.