Deadlock Recovery Algorithms in Wormhole Routed Meshes

• Main Authors: Yow-Min Shyr, 石侑民
• Other Authors: Sy-Yen Kuo
• Format: Others
• Language: zh-TW
• Published: 2000
• Online Access: http://ndltd.ncl.edu.tw/handle/96090824268147107947

碩士 === 國立臺灣大學 === 電機工程學研究所 === 88 === With the growing number of networks, the solution to the deadlock problem in the communication of the network has become much more important. Since the probability of deadlock should be rare, deadlock recovery is more efficient and more cost effective than deadlock prevention. In the central-buffer based mesh, a floating lane is used to solve the deadlock problem. For the 2-dimensional mesh, a non-overhead deadlock recovery approach for the central-buffer based mesh has been proposed. Since the 3-dimensional mesh scheme is widely used in the network communication, how to solve the deadlock problem for the central-buffer based 3-dimensional mesh has become an urgent task. Due to the complexity of the 3-dimensional meshes, to dig out the property of the 3-dimensional mesh is the most important thing. Therefore, the property of the 3-dimensional mesh and the feasibility of deadlock recovery in the higher dimensional central-buffer based mesh without overhead are discussed in this paper. This paper generalizes a theorem for the central-buffer based meshes using the non-overhead deadlock recovery approach. The theorem demonstrates that given an n dimensional mesh, where n is greater than 2, while only one floating lane is used, deadlocks always exist. Also, a method with two floating lanes to solve the deadlock problem in 3-dimensional mesh efficiently is proposed. And the simulation results show that using two floating lanes is the more cost-effective way than using more floating lanes.