Abstract
The number of nodes inside supercomputers is continuously increasing. As detailed in the TOP500 list, there are now systems that include more than one million nodes; for instance China’s Tianhe-2. To cope with this huge number of cores, many interconnection networks have been proposed in the literature. However, in most cases, proposed topologies have shown gaps preventing these topologies from being actually implemented and manufactured. In this paper, we propose a new, implementation-friendly, topology for interconnection networks of massively parallel systems: torus-connected cycles (TCC). Torus-based networks have proven very popular in the recent years: the Fujitsu K and Cray Titan are two examples of supercomputers whose interconnection networks are based on the torus topology.
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
Preview
Unable to display preview. Download preview PDF.
References
TOP500: China’s Tianhe-2 Supercomputer Takes No. 1 Ranking on 41st TOP500 List (June 17, 2013), http://top500.org/blog/lists/2013/06/press-release/ (last accessed August 2013)
Li, Y., Peng, S., Chu, W.: Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. J. Supe. 53, 329–351 (2010)
Bossard, A., Kaneko, K., Peng, S.: Node-to-set disjoint paths routing in metacube. In: Proc. Int. Conf. Par. Dis. Comp. Sys., pp. 289–296 (2010)
Ghose, K., Desai, K.R.: Hierarchical cubic networks. IEEE Trans. Par. Dis. Sys. 6, 427–435 (1995)
Bossard, A., Kaneko, K.: Node-to-set disjoint-path routing in hierarchical cubic networks. Comp. J. 55, 1440–1446 (2012)
Bossard, A., Kaneko, K.: Set-to-set disjoint paths routing in hierarchical cubic networks. Comp. J. (to appear)
Malluhi, Q.M., Bayoumi, M.A.: The hierarchical hypercube: a new interconnection topology for massively parallel systems. IEEE Trans. Par. Dis. Sys. 5, 17–30 (1994)
Wu, J., Sun, X.-H.: Optimal cube-connected cube multicomputers. J. Microcomp. Applications 17, 135–146 (1994)
Bossard, A., Kaneko, K., Peng, S.: A new node-to-set disjoint-path algorithm in perfect hierarchical hypercubes. Comp. J. 54, 1372–1381 (2011)
Bossard, A., Kaneko, K.: The set-to-set disjoint-path problem in perfect hierarchical hypercubes. Comp. J. 55, 769–775 (2012)
Preparata, F.P., Vuillemin, J.: The cube-connected cycles: a versatile network for parallel computation. Comm. ACM 24 (1981)
Seitz, C.L.: The cosmic cube. Comm. ACM 28 (1985)
Horiguchi, S., Ooki, T.: Hierarchical 3D-torus interconnection network. In: Proc. Int. Symp. Par. Arch. Alg. Net., pp. 50–56 (2000)
Al Faisal, F., Rahman, M.M.H.: Symmetric tori connected torus network. In: Proc. Int. Conf. Comp. Inf. Tech., pp. 174–179 (2009)
Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection networks: an engineering approach. Morgan Kaufmann (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Bossard, A., Kaneko, K. (2013). Torus-Connected Cycles: An Implementation-Friendly Topology for Interconnection Networks of Massively Parallel Systems. In: Aversa, R., Kołodziej, J., Zhang, J., Amato, F., Fortino, G. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2013. Lecture Notes in Computer Science, vol 8286. Springer, Cham. https://doi.org/10.1007/978-3-319-03889-6_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-03889-6_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03888-9
Online ISBN: 978-3-319-03889-6
eBook Packages: Computer ScienceComputer Science (R0)