Foundation for designing deadlock-free routing algorithms in wormhole networks

D. N. Jayasimha, D. Manivannan, Jeff A. May, Loren Schwiebert, Stephen L. Hary

Research output: Contribution to journalConference articlepeer-review

4 Scopus citations


This paper provides necessary and sufficient conditions for deadlock-free unicast and multicast routing with the path-based routing model in interconnection networks which use the wormhole switching technique. The theory is developed around three central concepts: channel waiting, False Resource Cycles, and valid destination sets. The first two concepts are suitable extensions to those developed for unicast routing by two authors of this paper; the third concept has been developed by Lin and Ni. The necessary and sufficient conditions can be applied in a straightforward manner to prove deadlock freedom and to find more adaptive routing algorithms for collective communication. The latter point is illustrated by developing two routing algorithms for multicast communication in 2-D mesh architectures. The first algorithm uses fewer resources (channels) than an algorithm proposed in the literature but achieves the same adaptivity. The second achieves full adaptivity for multicast routing.

Original languageEnglish
Pages (from-to)190-197
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - 1996
EventProceedings of the 1996 8th IEEE Symposium on Parallel and Distributed Processing - New Orleans, LA, USA
Duration: Oct 23 1996Oct 26 1996

ASJC Scopus subject areas

  • Engineering (all)


Dive into the research topics of 'Foundation for designing deadlock-free routing algorithms in wormhole networks'. Together they form a unique fingerprint.

Cite this