Abstract
Recursive dual-net (RDN) is a newly proposed interconnection network for massive parallel computers. The RDN is based on recursive dual-construction of a symmetric base-network. A k-level dual-construction for k > 0 creates a network containing \({{(2n_0)^{2^k}/2}}\) nodes with node-degree d 0 + k, where n 0 and d 0 are the number of nodes and the node-degree of the base network, respectively. The RDN is a symmetric graph and can contain huge number of nodes with small node-degree and short diameter. Node-to-set disjoint-paths routing is fundamental and has many applications for fault-tolerant and secure communications in a network. In this paper, we propose an efficient algorithm for set-to-set disjoint-paths routing in RDN. We show that, given two sets of d 0 + k nodes, S and T in RDN k(B), d 0 + k disjoint paths, each connecting a node in S to a node in T, can be found in O(lglgN * lgN) time, where N is the number of nodes in RDN k(B). The length of the paths is at most 3(D 0/2 + 1)(lgN + 1)/(lgn 0 + 1), where D 0 and n 0 are the diameter and the number of nodes of base-network B, respectively.
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
Adiga, N.R., Blumrich, M.A., Chen, D., Coteus, P., Gara, A., Giampapa, M.E., Heidelberger, P., Singh, S., Steinmacher-Burow, B.D., Takken, T., Tsao, M., Vranas, P.: Blue gene/l torus interconnection network. IBM Journal of Research and Development 49(2/3), 265–276 (2005)
Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38(4), 555–566 (1989)
Beckman, P.: Looking toward exascale computing. In: Proceedings of the 2008 International Conference on Parallel and Distributed Computing, Applications and Technologies (December 2008) keynote speaker
Bossard, A., Kaneko, K., Peng, S.: Node-to-set disjoint-paths routing in metacube. In: Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 8–11. IEEE Computer Society Press, Hiroshima (2009)
Corbett, P.F.: Rotator graphs: An efficient topology for point-to-point multiprocessor networks. IEEE Transactions on Parallel and Distributed Systems 3(5), 622–626 (1992)
Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems 5(1), 31–38 (1994)
Duato, J., Yalamanchili, S., Ni, L.: Interconnection Networks: An Engineering Approach. IEEE Computer Society Press, Los Alamitos (1997)
Gu, Q.P., Peng, S.: Set-to-set fault tolerant routing in star graphs. IEICE Trans. on Information and Systems E79-D(4), 282–289 (1996)
Gu, Q.P., Peng, S.: Node-to-set disjoint paths problem in star graphs. Information Processing Letters 62(4), 201–207 (1997)
Gu, Q.P., Peng, S.: Node-to-set and set-to-set cluster fault tolerant routing in hypercubes. Parallel Computing 24(9), 1245–1261 (1998)
Jovanovic, Z., Misic, J.V.: Fault tolerance of the star graph interconnection network. Information Processing Letters 49(3), 145–150 (1994)
Kaneko, K., Suzuki, Y.: Node-to-set disjoint paths problem in pancake graphs. IEICE Transactions on Information and Systems E86-D(9), 1628–1633 (2003)
Latifi, S.: On the fault-diameter of the star graph. Information Processing Letters 46(3), 143–150 (1993)
Li, Y., Peng, S.: Dual-cubes: a new interconnection network for high-performance computer clusters. In: Proceedings of the 2000 International Computer Symposium, Workshop on Computer Architecture, ChiaYi, Taiwan, pp. 51–57 (December 2000)
Li, Y., Peng, S., Chu, W.: Metacube - a new interconnection network for large scale parallel systems. Australian Computer Science Communications 24(3), 29–36 (2002)
Li, Y., Peng, S., Chu, W.: Disjoint-paths and fault-tolerant routing on recursive dual-net. In: Proceedings of the International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 48–56. IEEE Computer Society Press, Hiroshima (2009)
Li, Y., Peng, S., Chu, W.: Recursive dual-net: A new versatile network for supercomputers of the next generation. Journal of Chinese Institute of Engineer 32, 931–938 (2009)
Li, Y., Peng, S., Chu, W.: Node-to-set disjoint-paths routing in recursive dual-net. In: Proceedings of the First International Conference on Networking and Computing, Higashi Hiroshima, Japan, pp. 9–14 (November 2010)
Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Transactions on Information and Systems E86-D(3), 610–615 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Peng, S., Chu, W. (2011). Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net. In: Xiang, Y., Cuzzocrea, A., Hobbs, M., Zhou, W. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2011. Lecture Notes in Computer Science, vol 7016. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24650-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-24650-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24649-4
Online ISBN: 978-3-642-24650-0
eBook Packages: Computer ScienceComputer Science (R0)