Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

@article{Dally1987DeadlockFreeMR,
  title={Deadlock-Free Message Routing in Multiprocessor Interconnection Networks},
  author={William J. Dally and Charles L. Seitz},
  journal={IEEE Transactions on Computers},
  year={1987},
  volume={C-36},
  pages={547-553}
}
A deadlock-free routing algorithm can be generated for arbitrary interconnection networks using the concept of virtual channels. A necessary and sufficient condition for deadlock-free routing is the absence of cycles in a channel dependency graph. Given an arbitrary network and a routing function, the cycles of the channel dependency graph can be removed by splitting physical channels into groups of virtual channels. This method is used to develop deadlock-free routing algorithms for k-ary n… CONTINUE READING
Highly Influential
This paper has highly influenced 133 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 2,627 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 1,133 extracted citations

Constructing virtual 5-dimensional tori out of lower-dimensional network cards

Concurrency and Computation: Practice and Experience • 2019
View 16 Excerpts
Method Support
Highly Influenced

Scalable Deadlock-Free Deterministic Minimal-Path Routing Engine for InfiniBand-Based Dragonfly Networks

IEEE Transactions on Parallel and Distributed Systems • 2018
View 20 Excerpts
Highly Influenced

Easy Formal Specification and Validation of Unbounded Networks-on-Chips Architectures

ACM Trans. Design Autom. Electr. Syst. • 2012
View 6 Excerpts
Highly Influenced

Deadlock analysis in minimal adaptive routing algorithms using Petri Nets

2010 IEEE International Conference on Systems, Man and Cybernetics • 2010
View 6 Excerpts
Method Support
Highly Influenced

A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

1994 International Conference on Parallel Processing Vol. 1 • 1994
View 10 Excerpts
Highly Influenced

Optimal Multicast Communication in Wormhole-Routed Torus Networks

1994 International Conference on Parallel Processing Vol. 1 • 1994
View 7 Excerpts
Highly Influenced

Performance Analysis of Mesh Interconnection Networks with Deterministic Routing

IEEE Trans. Parallel Distrib. Syst. • 1994
View 6 Excerpts
Highly Influenced

2,628 Citations

050100150'86'93'01'09'17
Citations per Year
Semantic Scholar estimates that this publication has 2,628 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

A DAGbased algorithm for prevention of storeandforward deadlock in packet networks

D. Gelernter
IEEE Trans . Comput . • 1986

Deadlock avoidance in storeandforward networksI : Storeandforward deadlock

P. J. Schweitzer
1982

Prevention of deadlocks in packet - switched data transport systems

K. D. Gunther
IEEE Trans . Commun . • 1981

The cubeconnected cycles : A versatile network for parallel computation

J. E. Vuillemin
Proc . 20 th IEEE Symp . Foundations Comput . Sci . • 1980

Brashkow , " A large scale homogeneous machine

R. T.
Proc . 4 th Annu . Symp . Comput . Architecture