Connectivity of X-Hypercubes and Its Applications


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 1, No. 1, pp. 92-98, May. 1994
10.3745/KIPSTE.1994.1.1.92,   PDF Download:

Abstract

The hypercubes-like interconnection network, X-hypercubes, has the same number of nodes and edges as conventional hypercubes. By slightly changing the interconnection way between nodes, however, X-hypercubes reduces the diameter by almost half. Thus the communication delay in X-hypercubes can be expected to be much lower than that in hypercubes. This paper gives a new definition of X-hypercubes establishing clear-cut condition of connection between two nodes. As application examples of the new definition, this paper presents simple embeddings of hypercubes in X-hypercubes and vice versa. This means that any programs written for hypercubes can be transported onto X-hypercubes and vice versa with minimal overhead. This paper also present bitonic merge sort for X-hypercubes by simulating that for hypercubes.


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]
K. K. Hee, "Connectivity of X-Hypercubes and Its Applications," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 1, no. 1, pp. 92-98, 1994. DOI: 10.3745/KIPSTE.1994.1.1.92.

[ACM Style]
Kwon Kyung Hee. 1994. Connectivity of X-Hypercubes and Its Applications. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 1, 1, (1994), 92-98. DOI: 10.3745/KIPSTE.1994.1.1.92.