Randomized protocols for low-congestion circuit routing in multistage interconnection networks

Authors:
Richard Cole;Bruce M. Maggs;Friedhelm Meyer auf der Heide;Michael Mitzenmacher;Andréa W. Richa;Klaus Schröder;Ramesh K. Sitaraman;Berthold Vöcking
Affiliations:
Courant Institute, New York University, New York, NY;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Department of Mathematics and Computer Science, and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany;Digital Systems Research Center, Palo Alto, CA;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA;Department of Mathematics and Computer Science, and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany;Department of Computer Science, University of Massachusetts, Amherst, MA;Department of Mathematics and Computer Science, and Heinz Nixdorf Institute, University of Paderborn, 33095 Paderborn, Germany
Venue:
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Year:
1998

Citing 22
Cited 12

Efficient Schemes for Parallel Communication

Journal of the ACM (JACM)
How to emulate shared memory

Journal of Computer and System Sciences
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Methods for message routing in parallel machines

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple algorithms for routing on butterfly networks with bounded queues

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Call preemption in communication networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks

IEEE Transactions on Computers - Special issue on fault-tolerant computing
An O(log N) deterministic packet-routing scheme

Journal of the ACM (JACM)
Simple, efficient shared memory simulations

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Randomized routing and sorting on fixed-connection networks

Journal of Algorithms
Balanced allocations (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Self-routing superconcentrators

Journal of Computer and System Sciences
On-line Algorithms for Path Selectionin a Nonblocking Network

SIAM Journal on Computing
Exploiting storage redundancy to speed up randomized shared memory simulations

Theoretical Computer Science
On the benefit of supporting virtual channels in wormhole routers

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Universal algorithms for store-and-forward and wormhole routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Permutation Network

Journal of the ACM (JACM)
Finding the right ATM switch for the market

Computer
An Experimental Study of Wormhole Routing in Parallel Computers

Proceedings of the First Heinz Nixdorf Symposium on Parallel Architectures and Their Efficient Use
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
Load balancing and density dependent jump Markov processes

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Infinite parallel job allocation (extended abstract)

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
On Evil Twin Networks and the Value of Limited Randomized Routing

IEEE Transactions on Parallel and Distributed Systems
On Balls and Bins with Deletions

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Simplified Witness Tree Arguments

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
How asymmetry helps load balancing

Journal of the ACM (JACM)
Reducing Network Congestion and Blocking Probability through Balanced Allocation

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
How Asymmetry Helps Load Balancing

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Efficient Protocols for Permutation Routing on All-Optical Multistage Interconnection Networks

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Balanced allocation on graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A collision model for randomized routing in fat-tree networks

Journal of Parallel and Distributed Computing
Randomized load balancing strategies with churn resilience in peer-to-peer networks

Journal of Network and Computer Applications
Stabilizing consensus with the power of two choices

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Randomized protocols for low-congestion circuit routing in multistage interconnection networks

Quantified Score

Visualization

Abstract