Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
Explicit expanders and the Ramanujan conjectures
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Combinatorica
Expanders, sorting in rounds and superconcentrators of limited depth
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Improved Sorting Networks with O(log n) Depth
Improved Sorting Networks with O(log n) Depth
Layered cross product—a technique to construct interconnection networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
How much can hardware help routing?
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Theory of Wormhole Routing in Parallel Computers
IEEE Transactions on Computers
How much can hardware help routing?
Journal of the ACM (JACM)
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Deadlock-free routing in arbitrary networks via the flattest common supersequence method
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Butterflies and Peer-to-Peer Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Deterministic Routing of h-relations on the Multibutterfly
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An area-efficient high-throughput hybrid interconnection network for single-chip parallel processing
Proceedings of the 45th annual Design Automation Conference
Mesh-of-trees and alternative interconnection networks for single-chip parallelism
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A theory of decomposition into prime factors of layered interconnection networks
Discrete Applied Mathematics
| Hi-index | 0.01 |
A deterministic O(log N)-time algorithm for the problem of routing an aribitrary permutation on an N-processor bounded-degree network with bounded buffers is presented.Unlike all previous deterministic solutions to this problem, our routing scheme does not reduce the routing problem to sorting and does not use the sorting network of Ajtai, et al. [1]. Consequently, the constant in the run time of our routing scheme is substantially smaller, and the network topology is significantly simpler.