Abstract
Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems. In a hypercube of dimension n, node addresses are made of n bits, and two nodes are adjacent if and only if their Hamming distance is equal to 1. In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty nodes f disjoint paths connecting one source node to k = n − f destination nodes in O(n 2) time complexity.
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
White, A., Grice, D. (IBM): Roadrunner: Science, Cell and a Petaflop/s. In: International Supercomputing Conference (2008)
EE Times: U.S. taps IBM for 20 petaflops computer (2009), http://eetimes.com/news/design/showArticle.jhtml?articleID=213000489
Vanvoorst, B., Seidel, S., Barscz, E.: Workload of an ipsc/860. In: Proc. Scalable High-Performance Computing Conf., pp. 221–228 (1994)
SGI: Origin2000 Rackmount Owner’s Guide, 007-3456-003 (1997), http://techpubs.sgi.com/
Saad, Y., Schultz, M.H.: Topological Properties of Hypercubes. IEEE Transactions on Computers 37(7), 867–872 (1988)
Gu, Q., Peng, S.: An Efficient Algorithm for Node-to-node Routing in Hypercubes with Faulty Clusters. The Computer Journal 39(1), 14–19 (1996)
Rabin, M.A.: Efficient dispersal of information for security. Journal of ACM 36(2), 335–348 (1989)
Kaneko, K.: An algorithm for node-to-set disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. and Systems E86-D(12), 2588–2594 (2003)
Gargano, L., Vaccaro, U., Vozella, A.: Fault tolerant routing in the star and pancake interconnection networks. Inf. Processing Letters 45(6), 315–320 (1993)
Gu, Q., Peng, S.: Node-to-set and Set-to-set Cluster Fault Tolerant Routing in Hypercubes. Parallel Computing 24(8), 1245–1261 (1998)
Latifi, S., Ko, H., Srimani, P.: Node-to-set Vertex Disjoint Paths in Hypercube Networks. Technical Report CS-98-107
Bossard, A., Kaneko, K., Peng, S.: Node-to-set Disjoint-path Routing Metacube. In: Proceedings of the 10th International Conference on Parallel and Distributed Computing, Applications and Technologies (2009)
Bossard, A., Kaneko, K., Peng, S.: A Node-to-set Disjoint-path Routing Algorithm in Metacube. In: Proceedings of the 10th International Symposium on Pervasive Systems, Algorithms and Networks (2009)
Bossard, A., Kaneko, K., Peng, S.: Node-to-set Disjoint Paths Problem in Perfect Hierarchical Hypercubes. In: Proceedings of the 9th Parallel and Distributed Computing and Networks (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bossard, A., Kaneko, K., Peng, S. (2010). Fault-Tolerant Node-to-Set Disjoint-Path Routing in Hypercubes. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6081. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13119-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-13119-6_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13118-9
Online ISBN: 978-3-642-13119-6
eBook Packages: Computer ScienceComputer Science (R0)