论文信息 - ON THE REARRANGEABILITY OF SHUFFLE-EXCHANGE NETWORKS

ON THE REARRANGEABILITY OF SHUFFLE-EXCHANGE NETWORKS

Let be the minimum positive integer so that the Shuffle-Exchange network with stages, inputs and outputs is rearrangeable. Beneš conjectured that . The best bounds known so far are . In this paper, we verify Beneš conjecture for , and use this result to show that . The case is considerably more complex than the case, which have been done in the literature. We believe that hidden in our proof there is some general technique that would help improve the bound further.

Ding-Zhu Du | Hung Q. Ngo | D. Du | H. Q. Ngo

[1] Seung-Woo Seo,et al. A New Routing Algorithm for a Class of Rearrangeable Networks , 1994, IEEE Trans. Computers.

[2] Nathan Linial,et al. Interpolation Between Bases and the Shuffle Exchange Network , 1989, Eur. J. Comb..

[3] V. E. Bene. Proving the rearrangeability of connecting networks by group calculations , 1975, The Bell System Technical Journal.

[4] Tse-Yun Feng,et al. The Universality of the Shuffle-Exchange Network , 1981, IEEE Transactions on Computers.

[5] Douglas Stott Parker,et al. Notes on Shuffle/Exchange-Type Switching Networks , 1980, IEEE Transactions on Computers.

[6] Seung Ryoul Maeng,et al. On the Correctness of Inside-Out Routing Algorithm , 1997, IEEE Trans. Computers.

[7] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[8] Cauligi S. Raghavendra,et al. Rearrangeability of the Five-Stage Shuffle/Exchange Network for N = 8 , 1987, IEEE Trans. Commun..

[9] A. Mullin,et al. Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[10] Cauligi S. Raghavendra,et al. Rearrangeability of multistage shuffle/exchange networks , 1988, IEEE Trans. Commun..

[11] Shing-Tsaan Huang,et al. Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks , 1986, IEEE Transactions on Computers.