Layouts for the shuffle-exchange graph based on the complex plane diagram
SIAM Journal on Algebraic and Discrete Methods
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Introduction to algorithms
A self-routing permutation network
Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A Fast and Low Cost Self-Routing Permutation Network
IEEE Transactions on Computers
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
IEEE Transactions on Computers
| Hi-index | 14.99 |
A multistage self-routing permutation network is presented. This network is constructed from concentrators and digit-controlled $2 \times 4$ switches. A destination-tag routing scheme is used to realize any arbitrary permutation. The network has $O(log^2\ N)$ gate-delay and uses $O(N^2)$ VLSI-area, where N is the number of inputs.1 Assuming packet-switching is used for message transmission, the delay and VLSI-area of the network are smaller than those of any self-routing permutation network presented to date.