Rearrangeability of shuffle-exchange networks

A proof for the rearrangeability of (2n-1)-stage shuffle-exchange networks with N=2/sup n/ inputs is given. The proof makes use of the notion of balanced matrices for representing passable permutations through a shuffle-exchange network. Because the proof is not constructive, it does not lead to a routing algorithm directly. Therefore, a heuristic algorithm is provided for routing arbitrary permutations on the (2n-1)-stage shuffle-exchange network. A new proof for the rearrangeability of the (2n-1) stage reduced Omega /sub N/ Omega /sub N//sup -1/ network is also given, and a routing algorithm using precomputed digit-controlled routing tags is presented.<<ETX>>

[1]  Tse-Yun Feng,et al.  On a Class of Multistage Interconnection Networks , 1980, IEEE Transactions on Computers.

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

[3]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[4]  Duncan H. Lawrie,et al.  Access and Alignment of Data in an Array Processor , 1975, IEEE Transactions on Computers.

[5]  Kyungsook Y. Lee.  On the Rearrangeability of 2(log2N) - 1 Stage Permutation Networks , 1985, IEEE Trans. Computers.

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

[7]  Kevin P. McAuliffe,et al.  The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture , 1985, ICPP.

[8]  Ralph Grishman,et al.  The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer , 1983, IEEE Transactions on Computers.

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

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

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

[12]  A. Yavuz Oruç,et al.  A Self-Routing Permutation Network , 1990, J. Parallel Distributed Comput..

[13]  Tuvi Etzion,et al.  An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network , 1986, SIAM J. Comput..

[14]  V. Benes,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[15]  Marc Snir,et al.  A Unified Theory of Interconnection Network Structure , 1986, Theor. Comput. Sci..

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