Dual of a complete graph as an interconnection network

Abstract

A new class of interconnection networks, called hypernetworks, was proposed recently. Hypernetworks are characterized by hypergraphs. Compared with point-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optical interconnects. The authors propose a scheme for deriving new hypernetworks using hypergraph duals. As an example, they investigate the dual, K/sub n/*, of the n-vertex complete graph K/sub n/, and show that it has many desirable properties. They also present a set of fundamental data communication algorithms for K/sub n/*. Their results indicate that the K/sub n/* hypernetwork is a useful and promising interconnection structure for high-performance parallel and distributed competing systems.