A New Interconnection Network for Multicornputer


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 12, pp. 3099-3108, Dec. 1998
10.3745/KIPSTE.1998.5.12.3099,   PDF Download:

Abstract

In this paper, we propose the hyper-star graph as a new topology for multicomputer and analyze the characteristics of its network parameters, such as degree, connectivity, scalability, routing, diameter, and embedding. Folded hyper-star graph FHS(2n,n), in which an extra link is added to hyper-star graph HS(2n,n), contains 2nCn vertices and has relatively lower degree and smaller diameter than the well-known hypercube graph. The folded hyper-star graph FHS(2n,n) and the hypercube Qn have the same number of vertices. In terms of the network cost, defined as the product of the degree and diameter, the former has less than n2/2 while the latter has n2. It means that folded hyper-star graph FHS(2n,n) is better than the hypercube Qn and its variations with respect to network cost. In addtion, we describe a method to embed hypercube Qn and n?n torus into hyper-star HS(2n,n) with dilation 2. , ,


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. H. Ok, K. B. Chul, L. H. Seok, "A New Interconnection Network for Multicornputer," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 12, pp. 3099-3108, 1998. DOI: 10.3745/KIPSTE.1998.5.12.3099.

[ACM Style]
Lee Hyeong Ok, Kim Byung Chul, and Lim Hyeong Seok. 1998. A New Interconnection Network for Multicornputer. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 12, (1998), 3099-3108. DOI: 10.3745/KIPSTE.1998.5.12.3099.