Abstract
This paper presents a new robust binary tree designed using the theory of robust data structures. A basic module composed of three elements is replicated as necessary to form the robust tree, allowing a tree to be built up in a modular fashion while preserving its robust characteristics. The proposed structure is shown to be able to detect 2 errors (2-detectable) or correct 1 error (1-correctable) in any module of the tree under a generic fault model. The advantages of the tree when compared with other proposed trees presented in the literature are presented. Results of fault/error injection experiments on an implementation of the proposed structure in C++, including error coverage and performance overhead, are also provided.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D.J. Taylor, D.E. Morgan and J.P. Black, “Redundancy in data structures: Improving software fault tolerance,” IEEE Trans. on Software Eng., vol. SE-6, no. 6, pp. 585–594, Nov. 1980.
K. Huang and J.A. Abraham, “Algorithm-based fault tolerance for matrix operations,” IEEE Trans. on Computers, vol. C-33, no. 6, pp. 518–528, June 1984.
J.P. Black, and D.J. Taylor, “Local correctability in robust storage structures,” Tech. Rep. CS-84-44, Dep. Comput. Sci., Univ of Waterloo, Dec. 1985.
C.-C. J. Li, P. P. Chen, and W. K. Fuchs, “Local concurrent error detection and correction in data structures using virtual backpointers”, IEEE Trans. on Computers, vol. 38, no. 11, pp. 1481–1492, Nov. 1989.
K. Kant, and A. Ravichandran, “Synthesizing robust data structures — An introduction,” IEEE Trans. on Computers, vol. 39, no. 2, pp. 161–173, Feb. 1990.
S.C. Seth, and R. Muralidhar, “Analysis and design of robust data structures,” in Dig FTCS-15, pp. 14-19, June 1985.
M. Sampaio, and J.P. Sauve, “Robust trees,” in Dig FTCS-15, pp. 23-28, June 1985.
K. Yoshihara, Y. Koga, and T. Ishihara, “A robust data structure scheme with checking loops,” in Dig FTCS-13, pp. 241-248, June 1983.
E. Reingold and W. Hansen, “Data Structures”, Little Brown Computer Series, library of congress, 1983.
I. Davis, “A locally correctable AVL tree,” in Dig FTCS-17, pp. 85-88, July 1987.
D.J. Taylor, D.E. Morgan and J.P. Black, “A locally correctable B-Tree implementation,” The Computer J., vol. 29, no. 3, pp. 269–276, Nov. 1986.
D.J. Taylor, “Error models in robust data structures,” in Dig FTCS-20, pp. 416-422, June 1990.
D.J. Taylor, D.E. Morgan and J.P. Black, “Redundancy in data structures: Some theoretical results,” IEEE Trans. on Software Eng., vol. SE-6, no. 6, pp. 595–602, Nov. 1980.
J.P. Black, D.J. Taylor, and D.E. Morgan, “A robust B-tree implementation,” in Proc. 5th Int. Conf. Software Eng., pp. 63-70, March 1981.
S.B. Lippman, “C++ Primer,” Addison Wesley. 1989.
K. A. Hua and J. Abraham, “Design of systems with concurrent error detection using software redundancy”, Proc. ACM/IEEE Fall Joint Computer Conference, Dallas, Texas, Nov. 1986.
G. A. Kanawati N. A. Kanawati and J.A. Abraham, “FERRARI: A Tool for The Validation of System Dependability Properties”, Dig FTCS-22, Boston, July 1992, pp. 336-344.
P. Banerjee, J.T. Rahmeh, C. Stunkel, V.S. Nair, K. Roy, V. Balasubramanian and J.A. Abraham, “Algorithmic-based fault tolerance on hypercube multiprocessor,” IEEE Trans. on Computers, vol. 39, no. 9, pp. 1132–1146, Sept. 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Kanawati, N.A., Kanawati, G.A., Abraham, J.A. (1995). A Modular Robust Binary Tree. In: Cristian, F., Le Lann, G., Lunt, T. (eds) Dependable Computing for Critical Applications 4. Dependable Computing and Fault-Tolerant Systems, vol 9. Springer, Vienna. https://doi.org/10.1007/978-3-7091-9396-9_26
Download citation
DOI: https://doi.org/10.1007/978-3-7091-9396-9_26
Publisher Name: Springer, Vienna
Print ISBN: 978-3-7091-9398-3
Online ISBN: 978-3-7091-9396-9
eBook Packages: Springer Book Archive