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
Multicomputer networks: message-based parallel processing
Multicomputer networks: message-based parallel processing
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
A framework for adaptive routing in multicomputer networks
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
The chaos router: a practical application of randomization in network routing
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Fully-adaptive routing: packet switching performance and wormhole algorithms
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 14.98 |
Adaptive nonminimal routing (or misrouting) may move messages away from their destinations to temporarily cope with the dynamic load in an interconnection network. In most cases, misrouting is more powerful and flexible than minimal routing, especially under nonuniform load distribution. However, to take advantage of its misrouting, we have to avoid deadlock, livelock, and starvation in the network and to maintain the network performance across all levels of loading. In this paper, we propose a new flow control scheme for misrouting, called valved routing. Valved routing controls message injection and transmission through logical valves associated with the router ports. Designing routers using valved routing requires a proper choice of design parameters. We will discuss how to find the range of feasible design parameters. Issues in implementing routers using valved routing will also be addressed. We have conducted extensive simulations to compare the performance of routers with and without valved routing. Our simulation results show that valved routing has promising performance advantages, at light as well as heavy network load. Compared with the voluntary misrouting [15], valved routing performs better in network throughput without sacrificing the latency.