Parallel Algorithms to Set Up the Benes Permutation Network
- 1 February 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (2) , 148-154
- https://doi.org/10.1109/tc.1982.1675960
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(log2N) time when a fully interconnected parallel computer with N processing elements is used. The algorithm runs in 0(N½) time on an N½× N½mesh-connected computer and 0(log4N) time on both a cube connected and a perfect shuffle computer with N processing elements. It runs in 0(k log3N) time on cube connected and perfect shuffle computers with N1+1/kprocessing elements.Keywords
This publication has 14 references indexed in Scilit:
- Optimal BPC Permutations on a Cube Connected SIMD ComputerIEEE Transactions on Computers, 1982
- A Self-Routing Benes Network and Parallel Permutation AlgorithmsIEEE Transactions on Computers, 1981
- The Phoenix ProjectACM SIGARCH Computer Architecture News, 1981
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel ComputerSIAM Journal on Computing, 1980
- A Model of SIMD Machines and a Comparison of Various Interconnection NetworksIEEE Transactions on Computers, 1979
- Generalized Connection Networks for Parallel Processor IntercommunicationIEEE Transactions on Computers, 1978
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977
- On a Class of Rearrangeable Switching Networks Part I: Control AlgorithmBell System Technical Journal, 1971
- A Permutation NetworkJournal of the ACM, 1968
- Very high-speed computing systemsProceedings of the IEEE, 1966