A New Interconnection Network Using Graph Merger


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 10, pp. 2615-2626, Oct. 1998
10.3745/KIPSTE.1998.5.10.2615,   PDF Download:

Abstract

In this paper, we propose a new interconnection network called RFM graph, which is the merger of the directed Rotator and Faber-Moore graph, and analyze fault tolerance, routing algorithm, node disjoint cycles and broadcasting algorithm. We also describe methods to embed star graph, 2-dimensional torus and bubblesort graph into RFM graph with unit expansion and 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, H. Y. Nam, L. H. Seok, "A New Interconnection Network Using Graph Merger," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 10, pp. 2615-2626, 1998. DOI: 10.3745/KIPSTE.1998.5.10.2615.

[ACM Style]
Lee Hyeong Ok, Heo Yeong Nam, and Lim Hyeong Seok. 1998. A New Interconnection Network Using Graph Merger. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 10, (1998), 2615-2626. DOI: 10.3745/KIPSTE.1998.5.10.2615.