Parallel Algorithms to Set Up the Benes Permutation Network

• Published in: IEEE transactions on computers Vol. C-31; no. 2; pp. 148 - 154
• Main Authors: Nassimi, D, Sahni, S
• Format: Journal Article
• Language: English
• Published: IEEE 01.02.1982
• Subjects: Benes permutation network; complexity; Complexity theory; Computational modeling; Computers; cube connected computer; Delays; fully connected SIMD computer; Heuristic algorithms; Indexes; mesh-connected computer; Multiprocessor interconnection; parallel algorithm; Parallel algorithms; perfect shuffle computer; set-up algorithm; Single instruction multiple data; Switches
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/TC.1982.1675960

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 2 N) 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(log 4 N) time on both a cube connected and a perfect shuffle computer with N processing elements. It runs in 0(k log 3 N) time on cube connected and perfect shuffle computers with N 1+1/k processing elements.