Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Optimality of wait-free atomic multiwriter variables
Information Processing Letters
Introduction to distributed algorithms
Introduction to distributed algorithms
Fault-containing self-stabilizing algorithms
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Eventually-serializable data services
Theoretical Computer Science
Self-stabilization
Information Processing Letters - Special issue in honor of Edsger W. Dijkstra
Self-Stabilization of Wait-Free Shared Memory Objects
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
A Stabilizing Search Tree with Availability Properties
ISADS '01 Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing Protocols for Dynamic Distributed Systems
Superstabilizing mutual exclusion
Distributed Computing
Self-stabilization preserving compiler
ACM Transactions on Programming Languages and Systems (TOPLAS)
Snap-stabilizing prefix tree for peer-to-peer systems
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing labeling and ranking in ordered trees
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Self-stabilization preserving compiler
SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems
On self-stabilizing search trees
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Self-stabilizing labeling and ranking in ordered trees
Theoretical Computer Science
| Hi-index | 0.00 |
A data structure is stabilizing if, for any arbitrary (and possibly illegitimate) initial state, any sequence of sufficiently many operations brings the data structure to a legitimate state. A data structure is available if, for any arbitrary state, the effect of any operation on the structure is consistent with the operation's response. This paper presents an available stabilizing data structure made from two constituents, a heap and a search tree. These constituents are themselves available and stabilizing data structures described in previous papers. Each item of the composite data structure is a pair (key, value), which allows items to be removed by either minimum value (via the heap) or by key (via the search tree) in logarithmic time. This is the first research to address the problem of constructing larger data structures from smaller ones that have desired availability and stabilization properties.