An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A self-routing permutation network
Journal of Parallel and Distributed Computing
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Setup Algorithms for Cube-Connected Parallel Computers Using Recursive Karnaugh Maps
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
Study of multistage SIMD interconnection networks
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A New Self-Routing Permutation Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Regular Sparse Crossbar Concentrators
IEEE Transactions on Computers
A Fast and Low Cost Self-Routing Permutation Network
IEEE Transactions on Computers
A New Self-Routing Multicast Network
IEEE Transactions on Parallel and Distributed Systems
Corrections to "Fast Self-Routing Permutation Switching on an Asympotically Minimum Cost Network"
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
A New Self-Routing Multicast Network
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network
IEEE Transactions on Computers
Routing Permutations on Baseline Networks with Node-Disjoint Paths
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 15.00 |
A self-routing permutation network with O((n lg n)) switches and O(lg/sup 2/n) routing time, where lg denotes log/sub 2/, is presented. More generally, a permutation network with O(kn/sup 1+1/k/) cost and O(k lg n) routing time for any k, 1or=k lg n, is described. This improves D. Nassimi and J. Sahni's (1982) routing algorithm that gives O(k lg/sup 3/ n) routing time for the same cost expression. The only networks capable of permutation switching with O(n lg n) cost and O(lg n) routing time are the AKS sorting network and E. Upfal's (1989) packet routing network, but the constants hidden in the complexities of these networks are so large that they remain impractical until n gets very large.