2,783 Hits in 4.2 sec

Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes

Dong Xiang, Yueli Zhang, Yi Pan, Jie Wu
2007 Proceedings of the International Conference on Parallel Processing  
A new deadlock-free adaptive routing algorithm is proposed for n−dimensional meshes with only two virtual channels, where a virtual channel can be shared by two consecutive planes without any cyclic channel  ...  The deadlock-free adaptive routing scheme is then modified to a deadlock-free adaptive fault-tolerant routing scheme based on a planarly constructed MCC fault model.  ...  [11] cannot handle fault-tolerant adaptive routing in n−dimensional meshes.  ... 
doi:10.1109/icpp.2007.30 dblp:conf/icpp/XiangZPW07 fatcat:vcu4g2tdzzbalooy7wwvd22wqe

Practical Deadlock-Free Fault-Tolerant Routing in Meshes Based on the Planar Network Fault Model

Dong Xiang, Yueli Zhang, Yi Pan
2009 IEEE transactions on computers  
The deadlock-free adaptive routing scheme is then modified to a deadlock-free adaptive fault-tolerant routing scheme based on a planar network (PN) fault model.  ...  The proposed deadlock-free adaptive routing scheme is also extended to n-dimensional meshes still using two virtual channels.  ...  An adaptive fault-tolerant routing algorithm in meshes is proposed with only two virtual channels.  ... 
doi:10.1109/tc.2008.211 fatcat:fuk4bfhe2rberll3fgpg3u6tcu

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model

Yi Yang, Meirun Chen, Hao Li, Lian Li
2014 Journal of Applied Mathematics  
This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing.  ...  Based on this model, we also develop a distributed fault-tolerant routing algorithm.  ...  In this paper, we concentrate on the adaptive routing with fault-tolerant in two-dimensional mesh.  ... 
doi:10.1155/2014/592638 fatcat:z6ndssqcqffx7jh73los42okt4

Page 1154 of IEEE Transactions on Computers Vol. 52, Issue 9 [page]

2003 IEEE Transactions on Computers  
propose a deterministic fault-tolerant and deadiock-free routing protocol in two-dimensional (2D) meshes based on dimension-order routing and the odd-even turn model.  ...  X-Y routing is an example of dimension-order routing used in two-dimensional (2D) meshes and tori.  ... 

Fault-tolerant wormhole routing in tori

Suresh Chalasani, Rajendra V. Boppana
1994 Proceedings of the 8th international conference on Supercomputing - ICS '94  
We present a method to enhance wormhole routing algorithms for deadlock-free fault-tolerant routing in tori. We consider arbitrarily-located faulty blocks and assume only local knowledge of faults.  ...  We p r o ve that at most four additional virtual channels are su cient to make a n y fully-adaptive algorithm tolerant t o m ultiple faulty blocks in torus networks.  ...  We use the Fully-Adaptive-2D and Fully-Adaptive-3D algorithms to provide fault-tolerant routing in n-dimensional tori. The routing logic is given in Figure 8 .  ... 
doi:10.1145/181181.181330 dblp:conf/ics/ChalasaniB94 fatcat:rjfzyua32vcgvapnc3pqpb7ehy

Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels

Jie Wu
2000 IEEE Transactions on Parallel and Distributed Systems  
We propose three fault-tolerant minimal routing algorithms which are adaptive to allow all messages to use any minimal path.  ...  A su cient condition for minimal routing in 2-D meshes with faulty blocks is proposed.  ...  . d Fault tolerance: For a high-dimensional mesh more node-disjoint paths are o ered; and hence, a higher degree of fault tolerance is expected.  ... 
doi:10.1109/71.841751 fatcat:4cqozl3u2faaxmvmvhpkr4dqcq

A low overhead, fault tolerant and congestion aware routing algorithm for 3D mesh-based Network-on-Chips

Hoda Naghibi Jouybari, Karim Mohammadi
2014 Microprocessors and microsystems  
In this paper, we propose FT-DyXYZ, an adaptive fault tolerant routing to tolerate permanent faulty links in 3D mesh based NOCs that uses proximity congestion information to balance traffic.  ...  To evaluate performance of our routing, we compared it with fault tolerant planar-adaptive routing in terms of average packet latency, throughput and reliability.  ...  In [16] , a well-known fault tolerant routing named planaradaptive, for 3D mesh and torus networks was proposed by Chien et al.  ... 
doi:10.1016/j.micpro.2014.09.005 fatcat:32uptbsg5jgfnnemuomh5y5kcy

A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes

Jie Wu
2003 Journal of Computer Science and Technology  
In this paper we propose a su cient condition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes.  ...  We also propose a dynamic planar adpative routing scheme that o ers better fault tolerance and adaptivity than the planar adaptive routing scheme in 3-D meshes.  ...  Before presenting a simple fault-tolerant and minimal routing in 3-D meshes, we rst review a fault-tolerant routing algorithm in 2-D meshes 15].  ... 
doi:10.1007/bf02946645 fatcat:22cle5tjqnecfo2vwq6kjndd2u

Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks

Jie Wu, Dajin Wang
2005 International Journal of Parallel, Emergent and Distributed Systems  
We propose a deterministic fault-tolerant and deadlock-free routing protocol in 2-dimensional (2-D) meshes based on Wu's fault-tolerant odd-even turn model and Wang's rectilinear-monotone polygonal fault  ...  The fault-tolerant odd-even turn protocol, also called extended X-Y routing, was originally proposed to achieve fault-tolerant and deadlock-free routing among traditional, rectangular fault blocks.  ...  The only overhead in the MCC is two different status maintained at an MCC node. 16 We have proposed a deterministic, fault-tolerant and deadlock-free routing protocol in two-dimensional meshes.  ... 
doi:10.1080/17445760500033341 fatcat:4ndvnbyrubccroghdpbig4ubyq

Wormhole routing techniques for directly connected multicomputer systems

Prasant Mohapatra
1998 ACM Computing Surveys  
Along with performance, fault tolerance is essential for message routing in multicomputers, and we thus discuss several fault-tolerant wormhole routing algorithms along with their fault-handling capabilities  ...  Depending on the usage of paths between the source and the destination, routing algorithms are classified as deterministic, fully adaptive, and partially adaptive.  ...  The author is thankful to Katrina Avery for her editorial assistance, which improved the readability of the article. The author also thanks the referees for their valuable comments.  ... 
doi:10.1145/292469.292472 fatcat:awgtqfbqvjfmvfibgxf3aeqlay

A theory of fault-tolerant routing in wormhole networks

J. Duato
1997 IEEE Transactions on Parallel and Distributed Systems  
Finally, we propose a methodology for the design of fault-tolerant routing algorithms, showing its application to n-dimensional meshes.  ...  This theory is developed on top of our necessary and sufficient condition for deadlock-free adaptive routing.  ...  Sudhakar Yalamanchili and the anonymous referees for their helpful comments and suggestions. This work was supported by the Spanish CICYT under Grant TIC94-0510-C02-01.  ... 
doi:10.1109/71.605766 fatcat:gfaxqbubvzewbo2i3s37kjckxy

Online Adaptive Fault-Tolerant Routing in 2D Torus [chapter]

Yamin Li, Shietung Peng, Wanming Chu
2005 Lecture Notes in Computer Science  
The proposed algorithms find a fault-free path between any two nonfaulty nodes with high probability in linear time by using only the local routing information of the network.  ...  For example, in a torus of size up to 128×128, where, the number of faulty nodes up to 15%, the heuristucsquare routing algorithm finds a fault-free path with a probability of 90% or higher.  ...  path P = (r → t) in mesh P = P ∪ P ; Adaptive-Square Routing Algorithm In this section, we describe another local-information-based, fault-tolerant routing algorithm, called Adaptive Square Routing.  ... 
doi:10.1007/11576235_20 fatcat:lr6j4xzlmjbkhhhudibmogxkmy

FT-Z-OE: A Fault Tolerant and Low Overhead Routing Algorithm on TSV-based 3D Network on Chip Links

Hoda NaghibiJouybari, Karim Mohammadi
2015 International Journal of Computer Applications  
The proposed routing is evaluated using a cycle-accurate network simulator and compared to planar-adaptive routing for a 3D mesh-based network.  ...  In this paper, FT-Z-OE (Fault Tolerant Z Odd-Even) routing, a distributed routing to tolerate permanent faults on vertical links of 3D NOCs is proposed.  ...  Fig.1: A 3D mesh with six directions FT-Z-OE Routing Odd-Even turn model for partial adaptive routing was proposed by Chiu [11] .  ... 
doi:10.5120/20123-2191 fatcat:k6oakwckqjaxpefitkyaechcd4

A Fault-tolerant Adaptive and Minimal Routing Scheme in $n$-D Meshes

J. Wu
2002 Computer journal  
A dynamic planar-adaptive routing scheme is presented that offers better fault tolerance and adaptivity than the regular planar-adaptive routing scheme in n-D meshes.  ...  In this paper a sufficient condition is given for minimal routing in n-dimensional (n-D) meshes with faulty nodes contained in a set of disjoint fault regions.  ...  The concept of partial adaptive routing is defined and a dynamic planar-adaptive routing approach is proposed that trades routing adaptivity for a simple deadlock-free routing with a better fault tolerance  ... 
doi:10.1093/comjnl/45.3.349 fatcat:itj2iynr55bipksji2nafesrpa

Evaluating the Performance of Adaptive Fault-Tolerant Routing Algorithms for Wormhole-Switched Mesh Interconnect Networks

F. Safaei, A. Khonsari, M. Fathy, A. H. Shantia, M. Ould-Khaoua
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
These networks carry a routing scheme suggested by Boppana and Chalasani [1] as an instance of a fault-tolerant method.  ...  performance and fault-tolerant demands in these networks.  ...  Boppana and Chalasani [1] have presented an efficient method to enhance the current wormhole-switched routing algorithms developed for high radix, low dimensional mesh networks for fault-tolerant routing  ... 
doi:10.1109/ipdps.2007.370596 dblp:conf/ipps/SafaeiKFSO07 fatcat:oqabl5i4cjdopbqwcogjloombu
« Previous Showing results 1 — 15 out of 2,783 results