DocumentCode
3600718
Title
A Sufficient Condition for Deadlock-Free Adaptive Routing in Mesh Networks
Author
Canwen Xiao ; Yue Yang ; Jianwen Zhu
Author_Institution
Nat. Univ. of Defense Technol., Changsha, China
Volume
14
Issue
2
fYear
2015
Firstpage
111
Lastpage
114
Abstract
Deadlock remains a central problem in interconnection network. In this paper, we establish a new theory of deadlock-free flow control for k-ary, n-cube mesh network, which enables the use of any minimal-path adaptive routing algorithms while avoiding deadlock. We prove that the proposed flow control algorithm is a sufficient condition for deadlock freedom in any minimal path, adaptive routing algorithms on k-ary, n-cube mesh network.
Keywords
concurrency control; multiprocessor interconnection networks; deadlock avoidance; deadlock-free adaptive routing; deadlock-free flow control; interconnection network; k-ary mesh network; mesh networks; minimal path routing algorithm; minimal-path adaptive routing algorithms; n-cube mesh network; Adaptive systems; Aerospace electronics; Mesh networks; Multiprocessor interconnection; Routing; System recovery; Wireless mesh networks; Deadlock-Free; flow control; k-ary; n-cube mesh network; sufficient condition;
fLanguage
English
Journal_Title
Computer Architecture Letters
Publisher
ieee
ISSN
1556-6056
Type
jour
DOI
10.1109/LCA.2014.2363829
Filename
6928476
Link To Document