论文信息 - On a class of (2n-1)-stage rearrangeable interconnection networks

On a class of (2n-1)-stage rearrangeable interconnection networks

A class of (2n-1)-stage rearrangeable multistage interconnection networks (MINs) that includes all the previously proposed 2n-1 stage MINs as special cases or subsets is proposed. Both permutation routing and generalized distributed tag routing algorithms of this class of MINs are proposed. It is shown that previously proposed routing algorithms for some specific rearrangeable networks are just special cases of the general routing algorithm.<<ETX>>

C.Y.R. Chen | J. C. Hsia

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

[2] Pen-Chung Yew,et al. An Easily Controlled Network for Frequently Used Permutations , 1981, IEEE Transactions on Computers.

[3] Charles Clos,et al. A study of non-blocking switching networks , 1953 .

[4] V. Benes. Permutation groups, complexes, and rearrangeable connecting networks , 1964 .

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

[6] D. C. Opferman,et al. On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[7] Cauligi S. Raghavendra,et al. On Self-Routing in Benes and Shuffle-Exchange Networks , 1991, IEEE Trans. Computers.

[8] Abraham Waksman,et al. A Permutation Network , 1968, JACM.

[9] Dharma P. Agrawal,et al. Graph Theoretical Analysis and Design of Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[10] Leslie G. Valiant,et al. A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[11] Tse-yun Feng,et al. A Survey of Interconnection Networks , 1981, Computer.