research-article

Set-to-set disjoint-path routing in perfect hierarchical hypercubes

Authors:

Antoine Bossard,

Keiichi KanekoAuthors Info & Claims

C3S2E '11: Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering

Pages 51 - 57

https://doi.org/10.1145/1992896.1992903

Published: 16 May 2011 Publication History

Get Access

Abstract

The perfect hierarchical hypercube (HHC) interconnection network has been introduced in the literature recently. Due to its hierarchical structure, an HHC can connect a significant number of nodes while retaining a low degree and a small diameter. In this paper we describe an algorithm solving the set-to-set disjoint-path routing problem in perfect hierarchical hypercubes. In an HHC₂^m+^m, given two sets S and D both containing k (≤ m + 1) nodes, the proposed algorithm finds k node-disjoint paths between the nodes of S and the nodes of D of lengths at most (m+1)(2^m+k+1)+3 in O(km2^m) time complexity.

References

[1]

Arthur S. Bland, Ricky A. Kendall, Douglas B. Kothe, James H. Rogers, and Galen M. Shipman. Jaguar: The world's most powerful computer. In Proceedings of the Cray User Group Conference, May 2009.

Google Scholar

[2]

Antoine Bossard, Keiichi Kaneko, and Shietung Peng. Node-to-set disjoint-path routing in perfect hierarchical hypercubes (to appear). In Proceedings of the 11th International Conference on Computational Science, June 2011.

Google Scholar

[3]

Sivarama P. Dandamudi and Derek L. Eager. On hypercube-based hierarchical interconnection network design. Journal of Parallel and Distributed Computing, 12(3):283--289, 1991.

Digital Library

Google Scholar

[4]

Kanad Ghose and Kiran R. Desai. The HCN: a versatile interconnection network based on cubes. In Proceedings of the 1989 ACM/IEEE Conference on Supercomputing, pages 426--435, November 1989.

Digital Library

Google Scholar

[5]

Qian-Ping Gu, Satoshi Okawa, and Shietung Peng. Set-to-set fault tolerant routing in hypercubes. IEICE Transactions on Fundamentals, E79-A(4):483--488, 1996.

Google Scholar

[6]

Qian-Ping Gu and Shietung Peng. An efficient algorithm for node-to-node routing in hypercubes with faulty clusters. The Computer Journal, 39(1):14--19, 1996.

Crossref

Google Scholar

[7]

Qian-Ping Gu and Shietung Peng. Set-to-set fault tolerant routing in star graphs. IEICE Transactions on Information and Systems, E79-D(4):282--289, 1996.

Google Scholar

[8]

Keiichi Kaneko and Shietung Peng. Disjoint paths routing in pancake graphs. In Proceedings of the 7th International Conference on Parallel and Distributed Computing, Applications and Technologies, pages 254--259, December 2006.

Digital Library

Google Scholar

[9]

Yamin Li, Shietung Peng, and Wanming Chu. Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. The Journal of Supercomputing, 53(2):329--351, 2010.

Crossref

Google Scholar

[10]

Qutaibah M. Malluhi and Magdy A. Bayoumi. The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Transactions on Parallel and Distributed Systems, 5(1):17--30, 1994.

Digital Library

Google Scholar

[11]

Jie Wu and Xian-He Sun. Optimal cube-connected cube multicomputers. Journal of Microcomputer Applications, 17(2):135--146, 1994.

Digital Library

Google Scholar

[12]

Ruei-Yu Wu, Gen-Huey Chen, Yu-Liang Kuo, and Gerard J. Chang. Node-disjoint paths in hierarchical hypercube networks. Information Sciences, 177(19):4200--4207, 2007.

Digital Library

Google Scholar

Cited By

View all

Phisutthangkoon NWerapun J(2021)Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.01.004150(139-154)Online publication date: Apr-2021
https://doi.org/10.1016/j.jpdc.2021.01.004

Index Terms

Set-to-set disjoint-path routing in perfect hierarchical hypercubes
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Graph algorithms analysis
      1. Network flows

Recommendations

k-pairwise disjoint paths routing in perfect hierarchical hypercubes

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 ...
Set-to-Set Disjoint-Path Routing in Metacube
PDCAT '10: Proceedings of the 2010 International Conference on Parallel and Distributed Computing, Applications and Technologies

In this paper, we propose an efficient algorithm that finds disjoint paths for set-to-set disjoint-paths routing in metacube. Metacube is a cluster-based, hypercube-like interconnection network that can connect a huge number of nodes with small amount ...
A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes

The perfect hierarchical hypercube (HHC) interconnection network, also known as the cube-connected cube, was introduced as a topology for large parallel computers. One of its interesting properties is that it can connect many nodes while retaining a ...

Comments

Information & Contributors

Information

Published In

C3S2E '11: Proceedings of The Fourth International C* Conference on Computer Science and Software Engineering

May 2011

162 pages

ISBN:9781450306263

DOI:10.1145/1992896

General Chair:
Bipin C. Desai
Concordia University, Montréal, QC, Canada
,
Program Chairs:
Alain Abran
École de technologie supérieure (ETS) de l'université du Québec
,
Sudhir P. Mudur
Concordia University, Canada

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 May 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Japan Society for the Promotion of Science

Conference

C3S2E '11

Sponsor:

ACM
Concordia University

C3S2E '11: Fourth International C* Conference on Computer Science & Software Engineering

May 16 - 18, 2011

Quebec, Montreal, Canada

Acceptance Rates

Overall Acceptance Rate 12 of 42 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
101
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Phisutthangkoon NWerapun J(2021)Shortest-path routing for optimal all-to-all personalized-exchange embedding on hierarchical hypercube networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2021.01.004150(139-154)Online publication date: Apr-2021
https://doi.org/10.1016/j.jpdc.2021.01.004

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

k-pairwise disjoint paths routing in perfect hierarchical hypercubes

Set-to-Set Disjoint-Path Routing in Metacube

A New Node-to-Set Disjoint-Path Algorithm in Perfect Hierarchical Hypercubes