Improved routing and sorting on multibutterflies
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized protocols for low-congestion circuit routing in multistage interconnection networks
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Priority Queues and Sorting Methods for Parallel Simulation
IEEE Transactions on Software Engineering
Loss-less condensers, unbalanced expanders, and extractors
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On Nonblocking Properties on the Benes Network
ESA '98 Proceedings of the 6th 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
On the Bisection Width and Expansion of Butterfly Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
An algorithmic Friedman--Pippenger theorem on tree embeddings and applications to routing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Compression of samplable sources
Computational Complexity
A parallel self-routing rearrangeable nonblocking multi-log2 N photonic switching network
IEEE/ACM Transactions on Networking (TON)
Fault tolerance design for large-scale optical switches
Optical Switching and Networking
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
Distributed full switch as an ideal system area network for multiprocessor computers
Automation and Remote Control
| Hi-index | 0.00 |
This paper presents the first optimal-time algorithms for path selection in an optimal-size nonblocking network. In particular, we describe an $N$-input, $N$-output, nonblocking network with $O(N \log N)$ bounded-degree nodes, and an algorithm that can satisfy any request for a connection or disconnection between an input and an output in $O(\log N)$ bit steps, even if many requests are made at once. Viewed in a telephone switching context, the algorithm can put through any set of calls among $N$ parties in $O(\log N)$ bit steps, even if many calls are placed simultaneously. Parties can hang up and call again whenever they like; every call is still put through $O(\log N)$ bit steps after being placed. Viewed in a distributed memory machine context, our algorithm allows any processor to access any idle block of memory within $O(\log N)$ bit steps, no matter what other connections have been made previously or are being made simultaneously.