JAYASIMHA, D. N., MANIVANNAN, D., MAY, J. A., SCHWIEBERT, L., AND HARY, S. L. A Foundation for Designing Deadlock-free Routing Algorithms in Wormhole Networks. In Symposium on Parallel and Distributed Processing (1996), pp. 190--197.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....are allowed to hold many resources while requesting others. Designing deadlock free routing algorithms using few hardware facilities is a major problem for wormhole routed networks. Many papers have been devoted to the crucial problem of deadlock avoidance in wormholerouted networks. References [20, 21, 23, 25, 26, 27, 29, 30, 49, 52, 53, 69, 70] is a non exhaustive list of papers giving necessary and sufficient conditions for deadlock avoidance. Even if all these papers deal with wormhole routing, the hypotheses slightly differ from one paper to another. In particular, the routing function is not exactly defined in the same way in all ....

....function specifying the route from one destination node to the next destination) is deadlock free. Duato gave in [27] and [30] a sufficient condition for deadlock avoidance which applies to adaptive functions depending on the current node, and the destination. Then Jayasimha et al. gave in [49] necessary and sufficient conditions for deadlock avoidance which apply to adaptive functions depending on the input channel, and the destination. The tree based facility was studied in [13, 75] for multistage networks. This facility allows an operation that replicates and forwards flits to ....

D. Jayasimha, D. Manivannan, J. May, L. Schwiebert, and S. Hary, A foundation for designing deadlock-free routing algorithms in wormhole networks, in Symposium on Parallel and Distributed Processing (SPDP '96), 1996, pp. 190--197.

....configurations must be addressed. This is done by introducing the notion of false resource cycles and providing a design methodology that distinguishes false resource cycles from cycles that produce deadlock configurations. This proof technique was recently generalized by Jayasimha, et al. [11] to support routing algorithms for collective communication, including multicasting. After introducing the assumptions and definitions used in this paper, we will describe how the notions of unreachable configuration and false resource cycle affect the requirements for deadlock free oblivious ....

JAYASIMHA, D. N., MANIVANNAN, D., MAY, J. A., SCHWIEBERT, L., AND HARY, S. L. A Foundation for Designing Deadlock-free Routing Algorithms in Wormhole Networks. In Symposium on Parallel and Distributed Processing (1996), pp. 190--197.

....yellow channels only, or (viii) a cycle involving yellow and black channels only. We can show by arguments similar to the ones given in the proof of Lemma 1 that none of these eight types of cycles exist. We omit the details of the proof for lack of space. However, a detailed proof can be found in [7]. 2 7. Conclusion We have solved an open problem by providing necessary and sufficient conditions for deadlock free wormhole routing with the path based multicast router model. The theory also holds for unicast routing and thus provides a unified approach to deadlock freedom. This is ....

D. N. Jayasimha, D. Manivannan, L. S. Jeff A. May, and S. L. Hary. "A Foundation for Designing Deadlock-free Routing Algorithms in Wormhole Networks". Technical Report OSU-CISRC-4/96-TR20), The Ohio State University, Department of Computer and Information Science, 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC