Thumbnail
Access Restriction
Subscribed

Author Jayasimha, D. N. ♦ Schwiebert, Loren ♦ Manivannan, D. ♦ May, Jeff A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2003
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Knowledge complexity ♦ Proof systems ♦ Statistical difference ♦ Zero knowledge
Abstract This article provides necessary and sufficient conditions for deadlock-free unicast and multicast routing with the $\textit{path-based}$ routing model in interconnection networks that 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 article; the third concept has been developed by Lin and Ni. The necessary and sufficient conditions relax the requirements for deadlock-free routing, compared to techniques that provide only a sufficient condition. These necessary and sufficient conditions can be applied in a straightforward manner to prove deadlock freedom of newly developed adaptive routing algorithms for collective communication, which in turn will help in developing efficient and correct routing algorithms. The latter point is illustrated by developing two routing algorithms for multicast communication on 2D mesh architectures. The first algorithm uses fewer resources (channels) than an algorithm proposed in the literature but achieves the same adaptiveness. The second algorithm provides fully adaptive routing for both unicast and multicast messages.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2003-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 50
Issue Number 2
Page Count 26
Starting Page 250
Ending Page 275


Source: ACM Digital Library