Abstract
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnec tion topologies formed by diluting links from binary hypercube. While they scale up more slowly, they provide more choices of network size. Despite sparser connectivity, they al low efficient emulation of many other topologies. However, there is no existing fault-tolerant routing strategy for FCs or other node/link diluted cubes. In this paper, we propose a unified fault-tolerant routing strategy for all Fibonacci-class Cubes, tolerating as many faulty components as network node availability. The algorithm is livelock free and generates deadlock-free routes, whose length is bounded linearly to network dimensionality. As a component, a generic approach to avoiding immediate cycles is designed which is applicable to a wide range of inter-connection networks, with computational and spatial complexity at O(1) and O(n log n) respectively. Finally, the performance of the algorithm is presented and analyzed through software simulation, showing its feasibility.
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
Hsu, W.J.: Fibonacci Cubes-A New Interconnection Topology. IEEE Transactions on Parallel and Distributed Systems 4(1), 3–12 (1993)
Qian, H., Hsu, W.J.: Enhanced Fibonacci Cubes. The Computer Journal 39(4), 331–345 (1996)
Wu, J.: Extended Fibonacci Cubes. IEEE Transactions on Parallel and Distributed Systems 8(12), 1203–1210 (1997)
Fu, A.W., Chau, S.: Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees. IEEE Transactions on Parallel and Distributed Systems 9(12), 1253–1268 (1998)
Loh, P.K.K., Hsu, W.J.: The Josephus Cube: A Novel Interconnection Network. Journal of Parallel Computing 26, 427–453 (1999)
Chen, M.-S., Shin, K.G.: Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers. IEEE Transactions on Parallel and Distributed Systems 1(2), 152–159 (1990)
Lan, Y.: An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers. IEEE Transactions on Parallel and Distributed Systems 6(11), 1147–1152 (1995)
Loh, P.K.K., Zhang, X.: A fault-tolerant routing strategy for Gaussian cube using Gaussian tree. In: 2003 International Conference on Parallel Processing Workshops, pp. 305–312 (2003)
Zhang, X.: Analysis of Fuzzy-Nero Network Communications. Undergraduate Final Year Project, Nanyang Technological University (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xinhua, Z., Loh, P.K.K. (2005). A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes. In: Srikanthan, T., Xue, J., Chang, CH. (eds) Advances in Computer Systems Architecture. ACSAC 2005. Lecture Notes in Computer Science, vol 3740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11572961_18
Download citation
DOI: https://doi.org/10.1007/11572961_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29643-0
Online ISBN: 978-3-540-32108-8
eBook Packages: Computer ScienceComputer Science (R0)