On a class of recursive network topologies

Abstract

Abstract For the interconnection of the nodes of massively parallel processor networks, concepts are required, which are extendable. In this paper, a ‘recursive network’ is described. With a basic building block, essentially with a fixed number of links, arbitrarily large systems can be configured. At all levels, the interconnection topology is the same. Hence, a simple routing algorithm can be applied. The recursive network is described and compared with hypercube and mesh networks (with respect to the system diameter and the efficient use of the links).