Hyperbanyan networks: a new class of networks for distributed-memory multiprocessors

A new class of connection topologies for distributed-memory multiprocessors, hyperbanyan networks, is introduced. A hyperbanyan is a combination of the topological designs of a banyan and the hypertree networks. Since the hypertree combines the advantages of the binary tree and the hypercube, a hyperbanyan has the features of a binary tree, a hypercube, and a banyan. The hyperbanyans have a fixed degree of five, and the diameter of an (n stage×2^n-1 nodes/stage) hyperbanyan is 2(n-1). A routing algorithm which is close to optimal is presented