The Community for Technology Leaders
Green Image
Issue No. 02 - February (1982 vol. 31)
ISSN: 0018-9340
pp: 148-154
D. Nassimi , Department of Electrical Engineering and Computer Science, Northwestern University
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>
set-up algorithm, Benes permutation network, complexity, cube connected computer, fully connected SIMD computer, mesh-connected computer, parallel algorithm, perfect shuffle computer

S. Sahni and D. Nassimi, "Parallel Algorithms to Set Up the Benes Permutation Network," in IEEE Transactions on Computers, vol. 31, no. , pp. 148-154, 1982.
94 ms
(Ver 3.3 (11022016))