Abstract
In this paper we first present fault tolerance techniques based on distributed algorithms for embedding binary trees in hypercubes. Starting with the root (invoked in some cube node by a host), each node is responsible for determining the addresses of its children, and for invoking the embedding algorithm for the subtree rooted at each child in the proper cube node. This distributed embedding, along with the wealth of communication links in the hypercube, leads to a high potential for fault tolerance. We demonstrate the fault tolerance capability by introducing restructuring techniques which may be used to tolerate faults during the initial embedding, as well as to remap nodes that fail at run-time. The distributed nature of the embeddings eliminates the need for global knowledge of faulty nodes; each node must only know the status of its neighbors.
This research is, in part, supported under ONR Contract N00014-80-C-04555
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.
Similar content being viewed by others
References
S. Bhatt and I. Ipsen, “How to Embed Trees in Hypercubes,” Research Report YALEU/DCS/RR-443, December 1985.
S. Deshpande and R. Jenevein, “Scalability of a Binary Tree on a Hypercube,” Proceedings of the ICPP, pp. 661–668, 1986.
S. Hosseini, J. Kuhl, and S. Reddy, “Distributed Fault Tolerance of Tree Structures,” IEEE Transactions on Computers, vol. C-36, no. 11, pp. 1378–1382, November 1987.
S.L. Johnsson, “Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures,” Journal of Parallel and Distributed Computing, vol. 4, pp. 133–172, 1987.
S.Y. Kung, C.W. Chang, and C.W. Jen, “Real-Time Configuration for Fault-Tolerant VLSI Array Processors,” Proceedings of Real-Time Systems Symposium, pp. 46–54, December 1986.
F.J. Provost and R. Melhem, “Fault Tolerant Embedding of Binary Trees in Hypercubes,” Technical Report 88–3, Department of Computer Science, University of Pittsburgh, Pittsburgh, PA, 1988.
C. Raghavendra, A. Avizienis, and M. Ercegovac, “Fault-Tolerance in Binary Tree Architectures,” IEEE Transactions on Computers, vol. C-33, no. 6, pp. 566–572, June 1984.
M. Sami and R. Stefanelli, “Reconfigurable Architectures for VLSI Implementation,” Proc. Nat’l Computer Conf., pp. 565–577, May 1983.
A. Wu, “Embedding of Tree Networks into Hypercubes,” Journal of Parallel and Distributed Computing, vol. 2, pp. 238–249, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Plenum Press, New York
About this chapter
Cite this chapter
Provost, F.J., Melhem, R. (1989). Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes. In: Koren, I. (eds) Defect and Fault Tolerance in VLSI Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6799-8_30
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6799-8_30
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4615-6801-8
Online ISBN: 978-1-4615-6799-8
eBook Packages: Springer Book Archive