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
ABSTRACT
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.
INDEX TERMS
perfect shuffle computer, Benes network, bit-permute-complement permutations, complexity, cube connected computer, inverse omega perputations, omega permutations
CITATION
D. Nassimi, S. Sahni, "A Self-Routing Benes Network and Parallel Permutation Algorithms", IEEE Transactions on Computers, vol. 30, no. , pp. 332-340, May 1981, doi:10.1109/TC.1981.1675791
98 ms
(Ver 3.3 (11022016))