Date of Award
5-1994
Document Type
Thesis
Abstract
The wormhole routing (WR) technique is replacing the hitherto popular storeand- forward routing in message passing multicomputers. This is because the latter has speed and node size constraints. The wormhole routing is, on the other hand, susceptible to deadlock. A few WR schemes suggested recently in the literature, concentrate on avoiding deadlock. This thesis presents a Directed Acyclic Graph (DAG) based WR technique. At low traffic levels the proposed method follows a minimal path. But the routing is adaptive at higher traffic levels. We prove that the algorithm is deadlock-free. This method is compared for its performance with a deterministic algorithm which is a de facto standard. We also compare its implementation costs with other adaptive routing algorithms and the relative merits and demerits are highlighted in the text.
Recommended Citation
Roy, John, "A Dag Based Wormhole Routing Strategy" (1994). LSU Historical Dissertations and Theses. 8277.
https://repository.lsu.edu/gradschool_disstheses/8277
DOI
10.31390/gradschool_disstheses.8277