Abstract
A new fault-tolerant binary tree architecture is proposed. The approach, employing redundant processors, is suitable for use in long-life unmaintained applications. In our proposed scheme, processors connected as n level full binary tree, are backed up by k spare processors so that the fault-tolerant binary tree can tolerate any set of k faults. This new scheme is compared to previously proposed fault-tolerant binary tree architectures. In particular, we show that the new scheme can achieve the same level of reliability as other proposed scheme while using significantly fewer spares.
This research was supported by the National Sciences and Engineering Research Council of Canada under Grant numbers A-1734 and 46197
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Chau, S.-C. Fault-Tolerance in Multi-Computer Networks. PhD thesis, Simon Fraser University, August, 1989.
Chau, S.-C. and A. L. Liestman. A Fault-Tolerant Binary Tree Architecture. Technical Report 88-8, Simon Fraser University, December, 1988.
Chau, S.-C. and A. L. Liestman. A Proposal for a Fault-Tolerant Binary Hypercube Architecture. In Digests of Papers of the 19 th International Symposium on Fault-Tolerant Computing, pages 323–330. The Computer Society, IEEE, June, 1989.
Chau, S.-C. and A. L. Liestman. Fault-Tolerant for Multistage Interconnection Networks. Technical Report 89-1, Simon Fraser University, March, 1989.
Chau, S.-C. and A. L. Liestman. A General Scheme for Fault-Tolerance in Multi-Computer Networks. September, 1989 Submitted to the IEEE Transactions on Computers.
S. Dutt and J. P. Hayes. Design and Reconfiguration Strategies for Near-Optimal k-Fault Tolerant Tree Architectures. In Digests of Papers of the 18 th International Symposium on Fault-Tolerant Computing, pages 328–333. The Computer Society, IEEE, 1988.
A. S. M. Hassan and V. K. Agarwal. A Fault-Tolerant Modular Architecture for Binary Trees. IEEE Transactions on Computers c-35(4):356–361, April, 1986.
M. Howells and V. K. Agarwal. A Reconfigurating Scheme for Yield Enhancement of Large Area Binary Tree Architectures. IEEE Transactions on Computers c-37(4):463–468, April, 1988.
C. L. Kwan and S. Toida. Optimal fault-tolerant realizations of hierarchical tree systems. In Digests of Papers of the 11 th International Symposium on Fault-Tolerant Computing, pages 176–178. he Computer Society, IEEE, 1981.
Mathew B. Lowrie and W. Kent Fuchs. Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance. IEEE Transactions on Computers c-36(10):1172–1182, October, 1987.
C. S. Raghavendra, A. Avizienis and M. D. Ercegovac. Fault Tolerance in Binary Tree Architecture. IEEE Transactions on Computers c-33(6):568–572, June, 1984.
Adit D. Singh. A Reconfigurable Modular Fault Tolerant Binary Tree Architecture. In Digests of Papers of the 18 th International Symposium on Fault-Tolerant Computing, pages 298–304. The Computer Society, IEEE, 1987.
D. P. Siewiorek and R. S. Swarz. The Theory and Practice of Reliable System Design. Digital Press, Bedford, MA, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chau, SC., Liestman, A.L. (1991). A fault-tolerant binary tree architecture. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_181
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive