Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
The connection machine
A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Tight bounds for oblivious routing in the hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Adaptive, minimal routing in hypercubes
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the design of interconnection networks for parallel and multiprocessor systems
On the design of interconnection networks for parallel and multiprocessor systems
Multiprocessor systems: interconnection networks, memory hierarchy, modeling and simulations
Multiprocessor systems: interconnection networks, memory hierarchy, modeling and simulations
Circuit-switched multicomputers and heuristic load placement
Circuit-switched multicomputers and heuristic load placement
Valved Routing: Efficient Flow Control for Adaptive Nonminimal Routing in Interconnection Networks
IEEE Transactions on Computers
| Hi-index | 0.01 |
We present the chaos router, an asynchronous adaptive router, which under certain circumstances can send messages farther from their destinations. The chaos router greatly simplifies the routing logic by removing the livelock protection of previous schemes. Through an effective use of randomness, whose sources include that due to the adaptively processed load, the natural timing differences of selftimed circuitry and explicitly injected randomization, the chaos router avoids long message routes with high probability. In this paper the router is described, it is argued that the chaos router is deadlock free and probabilistically live-lock and starvation free, and simulation results are presented showing that the chaos router performs well.