Abstract
As shown in the TOP500 list, hypercubes are popular as interconnection networks of massively parallel systems. This popularity comes mainly from the simplicity and ease of implementation of this topology. To avoid bottleneck situations, communication algorithms and routing in general is a critical topic for these high-performance systems. It has been shown that disjoint paths routing is a very desirable property for these communication algorithms. Effectively, disjoint paths ensure the absence of infamous parallel processing issues such as deadlocks, livelocks and starvations. In this paper, we propose a routing algorithm selecting in a hypercube internally node-disjoint paths between any two nodes, and such that the selected paths all satisfy a given bit constraint. This bit constraint mechanism enables the selection of multiple sets of disjoint paths between several node pairs each satisfying a distinct bit constraint, something impossible with conventional routing algorithms. The simultaneous selection of disjoint paths between different node pairs offers even better communication performance and system dependability. The correctness of the proposed algorithm is formally established and empirical evaluation is conducted to inspect the algorithm practical behaviour.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Saad, Y., Schultz, M.H.: Topological properties of hypercubes. IEEE Trans. Comput. 37(7), 867-872 (1988)
Seitz, C.L.: The cosmic cube. Commun. ACM 28(1), 22-33 (1985)
TOP500. List. http://top500.org/list/2014/06/, June 2014. Last accessed July 2014
Li, Y., Peng, S., Chu, W.: Efficient collective communications in dual-cube. J. Supercomput. 28(1), 71-90 (2004)
Li, Y., Peng, S., Chu, W.: Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. J. Supercomput. 53(2), 329-351 (2010)
Malluhi, Q.M., Bayoumi, M.A.: The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Trans. Parallel Distrib. Syst. 5(1), 17-30 (1994)
Ghose, K., Desai, K.R.:The HCN: a versatile interconnection network based on cubes. In: Proceedings of the 1989 ACM/IEEE Conference on Supercomputing, pp. 426-435. Reno, NV, USA, November 12-17 (1989)
Gao, S., Novick, B., Qiu, K.: From Hall’s matching theorem to optimal routing on hypercubes. J. Comb. Theory Ser. B 74, 291-301 (1998)
Sinanoglu, O., Karaata, M.H., AlBdaiwi, B.: An inherently stabilizing algorithm for node-to-node routing over all shortest node-disjoint paths in hypercube networks. IEEE Trans. Comput. 59(7), 995-999 (2010)
Bossard, A., Kaneko, K.: Time optimal node-to-set disjoint paths routing in hypercubes. J. Inf. Sci. Eng. 30(4), 1087-1093 (2014)
Gu Q.-P., Okawa S., Peng S.: Set-to-set fault tolerant routing in hypercubes. IEICE Trans. Fundam. E79-A(4):483-488 (1996)
Gu, Q.-P., Peng, S.: An efficient algorithm for the $k$-pairwise disjoint paths problem in hypercubes. J. Parallel Distrib. Comput. 60(6), 764-774 (2000)
Bossard, A., Kaneko, K.: On hypercube routing and fault tolerance with bit constraint. In: Proceedings of the Second International Symposium on Computing and Networking, pp. 40-49. Shizuoka City, Japan, December 10-12 (2014)
Li, Y., Peng, S., Chu, W.: Disjoint paths in metacube. In: Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems, pp. 43-50. Marina del Rey, CA, USA, November 3-5 (2003)
Murugesan, S.: Harnessing Green IT: principles and practices. IT Prof. 10(1), 24-33 (2008)
Chen, J., Kanj, I.A., Wang, G.: Hypercube network fault tolerance: a probabilistic approach. J. Interconnect. Netw. 6(1), 17-34 (2005)
Dietzfelbinger, M., Madhavapeddy, S., Sudborough, I.H.: Three disjoint path paradigms in star networks. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, pp. 400-406. Dallas, TX, USA, December 2-5 (1991)
Suzuki, Y., Kaneko, K.: An algorithm for node-disjoint paths in pancake graphs. IEICE Trans. Inf. Syst. E86-D(3):610-615 (2003)
Kaneko, K., Sawada, N.: An algorithm for node-to-node disjoint paths problem in burnt pancake graphs. IEICE Trans. Inf. Syst. E90-D(1):306-313 (2007)
Menger, K.: Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, 96-115 (1927)
Findler, R.B., Clements, J., Flanagan, C., Flatt, M., Krishnamurthi, S., Steckler, P., Felleisen, M.: DrScheme: a programming environment for scheme. J. Funct. Prog. 12(2), 159-182 (2002)
Acknowledgments
The authors sincerely thank the reviewers for their insightful comments. This study was partly supported by a Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science under Grant No. 25330079.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Bossard, A., Kaneko, K. (2016). On Solving the Container Problem in a Hypercube with Bit Constraint. In: Lee, R. (eds) Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2015. Studies in Computational Intelligence, vol 612. Springer, Cham. https://doi.org/10.1007/978-3-319-23509-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-23509-7_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23508-0
Online ISBN: 978-3-319-23509-7
eBook Packages: EngineeringEngineering (R0)