Rearrangeability of Reverse Shuffle / Exchange Networks


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 7, pp. 1842-1850, Jul. 1997
10.3745/KIPSTE.1997.4.7.1842,   PDF Download:

Abstract

This paper proposes a new rearrangeable algorithm in multistage reverse shuffle/exchange network. The best known lower bound of stages for rearrangeability in symmetric network is 2logN-1 stages. However, it has never been proved for nonsymmetric networks before. Currently, the best upper bound for the rearrangeability of a shuffle/exchange network in nonsymmetric network is 3logN-3 stages. We describe the rearrangeability of reverse shuffle/exchange multistage interconnection network on every arbitrary permutation with N?%u226416. This rearrangeability can be established by setting one more stages in the middle stage of the network to allow the reduced network to be topological equivalent to a class of rearrangeable networks. The results in this paper enable us to establish an upper bound, 2logN stages for rearrangeable reverse shuffle/exchange network with N?%u226416, and leads to the possibility of this bound when N>16.


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]
P. B. Soo, "Rearrangeability of Reverse Shuffle / Exchange Networks," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 7, pp. 1842-1850, 1997. DOI: 10.3745/KIPSTE.1997.4.7.1842.

[ACM Style]
Park Byoung Soo. 1997. Rearrangeability of Reverse Shuffle / Exchange Networks. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 7, (1997), 1842-1850. DOI: 10.3745/KIPSTE.1997.4.7.1842.