The Community for Technology Leaders
Green Image
Issue No. 05 - May (1985 vol. 34)
ISSN: 0018-9340
pp: 412-425
null Kyungsook Yoon Lee , Department of Computer and Information Science, The Ohio State University
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.
rearrangeability, Control algorithm, hardware redundancy, hardware requirement, interconnection network, multistage networks, passable permutations, permutation
null Kyungsook Yoon Lee, "On the Rearrangeability of 2(Iog<inf>2</inf>N) ?1 Stage Permutation Networks", IEEE Transactions on Computers, vol. 34, no. , pp. 412-425, May 1985, doi:10.1109/TC.1985.1676581
90 ms
(Ver 3.3 (11022016))