Parallel Paths in Folded Hyper-Star Graph


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 7, pp. 1756-1769, Jul. 1999
10.3745/KIPSTE.1999.6.7.1756,   PDF Download:

Abstract

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an alternative path can be established when nodes and edges fault on routing path. A Folded Hyper-Star graph FHS(2n,n), whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in a Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the diameter of Folded Hyper-Star graph FHS(2n,n) is 2n-1.


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, C. Jung, P. S. Bae, L. H. Seok, "Parallel Paths in Folded Hyper-Star Graph," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 7, pp. 1756-1769, 1999. DOI: 10.3745/KIPSTE.1999.6.7.1756.

[ACM Style]
Lee Hyeong Ok, Choi Jung, Park Seung Bae, and Lim Hyeong Seok. 1999. Parallel Paths in Folded Hyper-Star Graph. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 7, (1999), 1756-1769. DOI: 10.3745/KIPSTE.1999.6.7.1756.