Randomized Routing with Shorter Paths

Authors:
Eli Upfal;Sergio Felperin;Marc Snir
Affiliations:
-;-;-
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1996

Citing 11
Cited 2

Efficient Schemes for Parallel Communication

Journal of the ACM (JACM)
Interconnection networks for large-scale parallel processing: theory and case studies

Interconnection networks for large-scale parallel processing: theory and case studies
Randomized parallel communications on an extension of the omega network

Journal of the ACM (JACM)
Numerical recipes in C: the art of scientific computing

Numerical recipes in C: the art of scientific computing
An O(logN) deterministic packet routing scheme

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A time-randomness trade-off for oblivious routing

SIAM Journal on Computing
A guided tour of Chernoff bounds

Information Processing Letters
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
The network architecture of the Connection Machine CM-5 (extended abstract)

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N · log N) Bit-Complexity

IEEE Transactions on Computers
Systolic routing in an optical butterfly

PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study in this paper the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break "spatial locality," within each permutation, only log log N additional randomizing stages are needed to break "temporal locality" among successive permutations. Thus, log N bits of initial randomization per input, followed by log log N bits of randomization per packet are sufficient to ensure that t permutations are delivered in time t + log N. We present simulation results that validate this analysis.