On the Rearrangeability of 2(Iog2N) –1 Stage Permutation Networks
Kyungsook Yoon Lee · IEEE Transactions on Computers · 1985
For any parallel computer systems which consist of many processing elements and memories, interconnection networks provide communication paths among processing elements and memories. Both the rearrangeability proof and the control algorithm are well known for the Benes network, which is intrinsically symmetric. However, there has been little progress for the case of nonsymmetric networks of similar hardware requirements.