The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (1982 vol.31)
pp: 148-154
D. Nassimi , Department of Electrical Engineering and Computer Science, Northwestern University
ABSTRACT
A parallel algorithm to determine the switch settings for a Benes permutation network is developed. This algorithm can determine the switch settings for an N input/output Benes network in 0(log<sup>2</sup>N) time when a fully interconnected parallel computer with N processing elements is used. The algorithm runs in 0(N?) time on an N<sup>?</sup>? N<sup>?</sup>mesh-connected computer and 0(log<sup>
INDEX TERMS
set-up algorithm, Benes permutation network, complexity, cube connected computer, fully connected SIMD computer, mesh-connected computer, parallel algorithm, perfect shuffle computer
CITATION
D. Nassimi, S. Sahni, "Parallel Algorithms to Set Up the Benes Permutation Network", IEEE Transactions on Computers, vol.31, no. 2, pp. 148-154, February 1982, doi:10.1109/TC.1982.1675960
9 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool