Continuous routing and batch routing on the hypercube

Authors:
Yukon Chang;Janos Simon
Affiliations:
Department of Computer Science, Pennsylvania State University;Department of Computer Science, University of Chicago
Venue:
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Year:
1986

Efficient Schemes for Parallel Communication

Journal of the ACM (JACM)
The cosmic cube

Communications of the ACM - Special section on computer architecture
Routing, merging, and sorting on parallel models of computation

Journal of Computer and System Sciences
An Efficient General-Purpose Parallel Computer

Journal of the ACM (JACM)
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
A probabilistic relation between desirable and feasible, models of parallel computation

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An 0(n log n) sorting network

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI

Computational Aspects of VLSI

The efficiency of greedy routing in hypercubes and butterflies

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Bounding delays in packet-routing networks

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes

IEEE Transactions on Parallel and Distributed Systems
List-ranking on interconnection networks

Information and Computation

Hi-index	0.00