Deadlock-Free Routing Based on Ordered Links

@inproceedings{Chiu2002DeadlockFreeRB,
  title={Deadlock-Free Routing Based on Ordered Links},
  author={Dah-Ming Chiu and Miriam Kadansky and Radia J. Perlman and John Reynders and Guy L. Steele and Murat Yuksel},
  booktitle={LCN},
  year={2002}
}
This paper describes a new class of deadlock-free routing algorithms for irregular networks based on ordered links. In this case, the links are ordered by partitioning them into a set oflayers, each layer containing a spanning tree (when possible). Deadlock free routes can then be derived by using links with non-decreasing order. The deadlockfreedom property is proved. Two different implementations of the routing algorithm are studied. The resultant performance of these algorithms is then… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-5 of 5 extracted citations

Similar Papers

Loading similar papers…