Creator:
Bossard, Antoine ; Kaneko, Keiichi
Contributor:
Iacono, Mauro - ed. ; Kołodziej, Joanna - ed.
Title:
Torus-connected cycles: A simple and scalable topology for interconnection networks
Subtitle:
Group publication title:
Subject and Keywords:
algorithm ; routing ; Hamiltonian ; supercomputer ; parallel
Abstract:
Supercomputers are today made up of hundreds of thousands of nodes. The interconnection network is responsible for connecting all these nodes to each other. Different interconnection networks have been proposed; high performance topologies have been introduced as a replacement for the conventional topologies of recent decades. A high order, a low degree and a small diameter are the usual properties aimed for by such topologies. However, this is not sufficient to lead to actual hardware implementations. Network scalability and topology simplicity are two critical parameters, and they are two of the reasons why modern supercomputers are often based on torus interconnection networks (e.g., Fujitsu K, IBM Sequoia). ; In this paper we first describe a new topology, torus-connected cycles (TCCs), realizing a combination of a torus and a ring, thus retaining interesting properties of torus networks in addition to those of hierarchical interconnection networks (HINs). Then, we formally establish the diameter of a TCC, and deduce a point-to-point routing algorithm. Next, we propose routing algorithms solving the Hamiltonian cycle problem, and, in a two dimensional TCC, the Hamiltonian path one. Correctness and complexities are formally proved. The proposed algorithms are time-optimal.
Publisher:
Zielona Góra: Uniwersytet Zielonogórski
Resource Type:
DOI:
Pages:
Source:
AMCS, volume 25, number 4 (2015) ; click here to follow the link