DocumentCode
1661242
Title
PDR: a new scheme of deadlock-free routing in mesh/torus interconnection networks
Author
Wang, Hong ; Zhu, Xudong ; Du Xu ; Li, Leinin
Author_Institution
Key Lab. of Broadband Opt. Fiber Transmission & Commun. Networks, Univ. of Electron. Sci. & Technol. of China, Chengdu, China
Volume
1
fYear
2005
Firstpage
663
Abstract
In this paper, a new scheme of deadlock-free routing in wormhole mesh/torus interconnection networks, path-division routing (PDR), is proposed. PDR is designed to provide high routing flexibility and diversity without adopting a deadlock-recovery scheme, thus its implementation is very simple because no deadlock detection mechanism is needed. Two design methods of PDR algorithms, namely the division method and the integration method, are also presented. An implementation example of PDR is also given, and from simulation results, its performance is shown to be satisfying when compared to several well-known routing algorithms adopting traditional deadlock avoidance or deadlock recovery scheme.
Keywords
multiprocessor interconnection networks; network routing; performance evaluation; PDR; deadlock-free routing; division method; integration method; path-division routing; performance; wormhole mesh/torus interconnection networks; Communication networks; Electronic mail; Fabrics; Intelligent networks; Laboratories; Multiprocessor interconnection networks; Optical fibers; Routing; Switches; System recovery;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, Circuits and Systems, 2005. Proceedings. 2005 International Conference on
Print_ISBN
0-7803-9015-6
Type
conf
DOI
10.1109/ICCCAS.2005.1493494
Filename
1493494
Link To Document