A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing

Authors:
Ran Libeskind-Hadas
Affiliations:
Harvey Mudd College, Claremont, CA
Venue:
IEEE Transactions on Computers
Year:
1998

Citing 9
Cited 1

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems
Origin-based fault-tolerant routing in the mesh

Future Generation Computer Systems - Special issue on high-performance computer architecture
A necessary and sufficient condition for deadlock-free wormhole routing

Journal of Parallel and Distributed Computing
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks

IEEE Transactions on Computers
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Scouting: Fully Adaptive, Deadlock-Free Routing in Faulty Pipelined Networks

Proceedings of the 1994 International Conference on Parallel and Distributed Systems

A Note on 'A Tight Lower Bound on the Number of Channels Required for Deadlock-Free Wormhole Routing'

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

Wormhole routing is widely employed in current generation multicomputers and the design of deadlock-free wormhole routing algorithms is an important problem. In this note, we prove a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithms. This result has applications in proving that certain topologies do not admit deadlock-free wormhole routing algorithms, as well as applications in the design and analysis of fault-tolerant wormhole routing algorithms.