Issue No. 07 - July (1978 vol. 27)
J. Lenfant , Institut de Recherche en Informatique et Syst?mes Al?atoires, University of Rennes
The Benes binary network can realize any one-to-one mapping of its 2<sup>n</sup>inlets onto its 2<sup>n</sup>outlets. Several authors have proposed algorithms which compute control patterns for this network from any bijection assignment. However, these algorithms are both time-consuming and space-consuming. In order to meet the time constraints arising from the use of a Benes network as the alignm
switching network, Alignment network, Benes network, Clos network, divide-and-conquer technique, memory-processor connection, parallel computer, permutation network
J. Lenfant, "Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations," in IEEE Transactions on Computers, vol. 27, no. , pp. 637-647, 1978.