A simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network

The authors present a simple algorithm to route arbitrary permutations on 8-input 5-stage shuffle/exchange network. Their algorithm is based on balanced matrices and does not require any backtracking. This property is useful when pipelining is used with a single stage network and recirculation of data.<<ETX>>

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

[2]  Cauligi S. Raghavendra,et al.  Rearrangeability of multistage shuffle/exchange networks , 1987, ISCA '87.

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

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

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

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

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

[8]  H. Cam,et al.  Rearrangeability of shuffle-exchange networks , 1990, [1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation.