Node-to-set disjoint paths routing in a torus-connected cycles network

摘要

Recently, parallel processing systems have been studied very actively, and many topologies have been proposed for their interconnection networks. Nowadays, because they enable the connection of numerous nodes, these topologies are now very often based on hierarchical structures; these are commonly referred as Hierarchical Interconnection Networks (HINs). The torus-connected cycles topology (Bossard and Kaneko, 2013) is one such HIN; it combines an n-dimensional torus on one layer, and 2n-cycles (i.e. clusters) on a second layer. In this paper, we propose an algorithm that solves the node-to-set disjoint paths routing problem in a torus-connected cycles network.