The Community for Technology Leaders
Green Image
Issue No. 05 - May (1981 vol. 30)
ISSN: 0018-9340
pp: 332-340
D. Nassimi , Department of Electrical Engineering and Computer Science, Northwestern University
A Benes permutation network capable of setting its own switches dynamically is presented. The total switch setting and delay time for the N input utput self-routing network is O(log N). It is shown that the network is capable of performing a rich class of permutations. The self-routing scheme leads to efficient O(log N) parallel algorithms to perform the same class of permutations on cube connected and perfect shuffle computers.
perfect shuffle computer, Benes network, bit-permute-complement permutations, complexity, cube connected computer, inverse omega perputations, omega permutations

D. Nassimi and S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms," in IEEE Transactions on Computers, vol. 30, no. , pp. 332-340, 1981.
92 ms
(Ver 3.3 (11022016))