STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computing with faulty shared objects
Journal of the ACM (JACM)
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Stabilizing time-adaptive protocols
Theoretical Computer Science
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Distributed Algorithms
Self-Stabilization of Wait-Free Shared Memory Objects
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
State-optimal snap-stabilizing PIF in tree networks
ICDCS '99 Workshop on Self-stabilizing Systems
A Stabilizing Search Tree with Availability Properties
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing mutual exclusion
Distributed Computing
| Hi-index | 0.01 |
This paper proposes a weakening of stabilization suited to the model of objects updated and queried by operations (method invocations). The paper's main result is a construction for replicated search trees in a message-passing, synchronous distributed system. Any sequence of O(d) operations brings all trees to legitimate and consistent states, where d is the maximum number of items accessible in the set of search trees at the initial state.