Dual of a complete graph as an interconnection network

作     者：Zheng, SQ Wu, J 

作者机构：Univ Texas Dept Comp Sci Richardson TX 75083 USA Florida Atlantic Univ Dept Comp Sci & Engn Boca Raton FL 33431 USA 

出 版 物：《JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING》 (并行与分布式计算杂志)

年 卷 期：2000年第60卷第8期

页      面：1028-1046页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：algorithm communication hypernetwork interconnection network optical interconnect parallel and distributed computing 

摘      要：A new class of interconnection networks, the hypernetworks, has been proposed recently. Hypernetworks are characterized by hypergraphs. Compared with Feint-to-point networks, they allow for increased resource-sharing and communication bandwidth utilization, and they are especially suitable for optical interconnects. In this paper, we propose a scheme for deriving new hypernetworks using hypergraph duals. As an example, we investigate the dual, K-n*, of the n-vertex complete graph K-n and show that it has many desirable properties. We also present a set of fundamental data communication algorithms for K-n*. Our results indicate that the K-n* hypernetwork is a useful and promising interconnection structure for high-performance parallel and distributed computing systems. (C) 2000 Academic Press.