Abstract
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.
This research is sponsored by NSF award CAREER 97-9953 and and DARPA contract F33615-01-C-1901.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
SB Davidson, H Garcia-Molina, D Skeen. Consistency in partitioned networks. ACM Computing Surveys 17(3):341–370, 1985.
EW Dijkstra. EWD391 Self-stabilization in spite of ditributed control. In Selected Writings on Computing: A Personal Perspective, pages 41–46, Springer-Verlag, 1982.
S Dolev. Self-Stabilization. MIT Press, 2000.
S Dolev and T Herman. Superstabilizing protocols for dynamic distributed systems. Chicago Journal of Theoretical Computer Science, 3(4), 1997.
A Fekete, D Gupta, V Luchangco, N Lynch, A Shvartsman. Eventually-serializable data services. Theoretical Computer Science, 220:113–156, 1999.
S Ghosh, A Gupta, T Herman, and SV Pemmaraju. Fault-containing selfstabilizing algorithms. In PODC’96 Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pages 45–54, 1996.
T Herman. Superstabilizing mutual exclusion. Distributed Computing, 13(1):1–17, 2000.
T Herman, T Masuzawa. Available stabilizing heaps. Information Processing Letters 77:115–121, 2001.
T Herman, T Masuzawa. A stabilizing search tree with availability properties. Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (ISADS’01), pp. 398–405, March 2001.
JH Hoepman, M Papatriantafilou, P Tsigas. Self-stabilization of wait-free shared memory objects. In Distributed Algorithms, 9th International Workshop Proceedings (WDAG’95), Springer-Verlag LNCS:972, pp.273–287, 1995.
B Lampson. How to build a aighly available system using consensus. In 10th International Workshop on Distributed Algorithms (WDAG’96), Springer-Verlag LNCS 1151, pp. 1–17, 1996.
M Li, PMB Vitanyi. Optimality of wait-free atomic multiwriter variables. Information Processing Letters, 43:107–112, 1992.
M Satyanarayanan. Scalable, secure, and highly available distributed file access. IEEE Computer, 23(5):9–22, 1990.
G Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Herman, T., Pirwani, I. (2001). A Composite Stabilizing Data Structure. In: Datta, A.K., Herman, T. (eds) Self-Stabilizing Systems. WSS 2001. Lecture Notes in Computer Science, vol 2194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45438-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-45438-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42653-0
Online ISBN: 978-3-540-45438-0
eBook Packages: Springer Book Archive