Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
| Hi-index | 0.00 |
Shuffle-exchange networks have received a great deal of attention as interconnecting networks for parallel computing. One unsolved problem is the minimum by number of stages required by a shuffle-exchange network with 2^n inputs and outputs to be rearrangeable. It turns out that this problem was studied much earlier by Benes in his work on switching networks. Benes also conjectured that 2n - 1 stages suffice for rearrangeability and published the conjecture in a more general setting in 1975. So far, the conjecture has been verified only for n =