Fast algorithms for bit-serial routing on a hypercube

Authors:
B. Aiello;F. T. Leighton;B. Maggs;M. Newman
Affiliations:
Bell Communications Research Morristown, NJ;Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts;Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts;Temple Barker and Sloane Inc., Lexington, MA
Venue:
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Year:
1990

Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
A time-randomness tradeoff for oblivious routing

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Fast computation using faulty hypercubes

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Tight bounds for oblivious routing in the hypercube

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting in nearly logarithmic time on the hypercube and related computers

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Efficient schemes for parallel communication

PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized parallel communication (Preliminary Version)

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

Routing multiple paths in hypercubes

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal routing of parentheses on the hypercube

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast deflection routing for packets and worms

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
How much can hardware help routing?

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Bounding delays in packet-routing networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Theory of Wormhole Routing in Parallel Computers

IEEE Transactions on Computers
Universal Wormhole Routing

IEEE Transactions on Parallel and Distributed Systems
A polynomial-time tree decomposition to minimize congestion

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures

Hi-index	0.00