The Journal of Supercomputing

, Volume 67, Issue 2, pp 485–495 | Cite as

k-pairwise disjoint paths routing in perfect hierarchical hypercubes

  • Antoine BossardEmail author
  • Keiichi Kaneko


Hierarchical hypercubes (HHC), also known as cube-connected cubes, have been introduced in the literature as an interconnection network for massively parallel systems. Effectively, they can connect a large number of nodes while retaining a small diameter and a low degree compared to a hypercube of the same size. Especially (2 m +m)-dimensional hierarchical hypercubes (\(\mathit {HHC}_{2^{m}+m}\)), called perfect HHCs, are popular as they are symmetrical, which is a critical property when designing routing algorithms. In this paper, we describe an algorithm finding, in an \(\mathit{HHC}_{2^{m}+m}\), mutually node-disjoint paths connecting k=⌈(m+1)/2⌉ pairs of distinct nodes. This problem is known as the k-pairwise disjoint-path routing problem and is one of the important routing problems when dealing with interconnection networks. In an \(\mathit{HHC}_{2^{m}+m}\), our algorithm finds paths of lengths at most 2 m+1+m(2 m+1+1)+4 in O(25m ) time, where 2 m+1 is the diameter of an \(\mathit{HHC}_{2^{m}+m}\). Also, we have shown through an experiment that, in practice, the lengths of the generated paths are significantly lower than the worst-case theoretical estimations.


Interconnection network Algorithm Parallel processing Supercomputer HHC 



The authors sincerely thank the reviewers, especially Reviewers 1, 2, 4, 5, 6, and 9, for their insightful comments and suggestions that greatly improved the quality of this paper.


  1. 1.
    TOP500 (2011) Japan’s K computer tops 10 petaflop/s to stay atop TOP500 List., November 2011. Last accessed December 2012
  2. 2.
    Laudon J, Lenoski D (1997) System overview of the SGI origin 200/2000 product line. In: Proc IEEE compcon ’97, San Jose, CA, USA, pp 150–156 Google Scholar
  3. 3.
    Yang X, Megson GM, Evans DJ (2006) An oblivious shortest-path routing algorithm for fully connected cubic networks. J Parallel Distrib Comput 66(10):1294–1303 CrossRefzbMATHGoogle Scholar
  4. 4.
    Lai P-L, Hsu H-C, Tsai C-H, Stewart IA (2010) A class of hierarchical graphs as topologies for interconnection networks. Theor Comput Sci 411(31–33):2912–2924 CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Gu Q-P, Peng S (1998) An efficient algorithm for k-pairwise disjoint paths in star graphs. Inf Process Lett 67(6):283–287 CrossRefMathSciNetGoogle Scholar
  6. 6.
    Akers SB, Krishnamurthy B (1989) A group theoretic model for symmetric interconnection networks. IEEE Trans Comput 38(4):555–566 CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Duh D-R, Chen G-H, Fang J-F (1995) Algorithms and properties of a new two-level network with folded hypercubes as basic modules. IEEE Trans Parallel Distrib Syst 6(7):714–723 CrossRefGoogle Scholar
  8. 8.
    Malluhi QM, Bayoumi MA (1994) The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Trans Parallel Distrib Syst 5(1):17–30 CrossRefMathSciNetGoogle Scholar
  9. 9.
    Wu J, Sun X-H (1994) Optimal cube-connected cube multicomputers. J Microcomput Appl 17(2):135–146 CrossRefGoogle Scholar
  10. 10.
    Ghose K, Desai KR (1989) The HCN: a versatile interconnection network based on cubes. In: Proc 1989 ACM/IEEE conf on supercomputing, Reno, Nevada, USA, pp 426–435 CrossRefGoogle Scholar
  11. 11.
    De Bruijn NG (1946) A combinatorial problem. Proc K Ned Akad Wet 49:758–764 zbMATHGoogle Scholar
  12. 12.
    Wu R-Y, Chen G-H, Kuo Y-L, Chang GJ (2007) Node-disjoint paths in hierarchical hypercube networks. Inf Sci 177(19):4200–4207 CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Bossard A, Kaneko K, Peng S (2011) A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes. Comput J 54(8):1372–1381 CrossRefGoogle Scholar
  14. 14.
    Bossard A, Kaneko K (2012) The set-to-set disjoint-path problem in perfect hierarchical hypercubes. Comput J 55(6):769–775 CrossRefGoogle Scholar
  15. 15.
    Shiloach Y (1978) The two paths problem is polynomial. Technical Report CS-TR-78-654, Stanford University Google Scholar
  16. 16.
    Karp RM (1975) On the computational complexity of combinational problems. Networks 5:45–68 zbMATHMathSciNetGoogle Scholar
  17. 17.
    Gu Q-P, Peng S (1997) k-pairwise cluster fault tolerant routing in hypercubes. IEEE Trans Comput 46(9):1042–1049 CrossRefMathSciNetGoogle Scholar
  18. 18.
    Seitz CL (1985) The cosmic cube. Commun ACM 28(1):22–33 CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Graduate School of EngineeringTokyo University of Agriculture and TechnologyTokyoJapan

Personalised recommendations