Filters








21 Hits in 7.7 sec

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.  ...  Messages are routed via shortest paths when there are no faults, and this constraint is only slightly relaxed to facilitate routing in the presence of faults.  ...  Concluding remarks We h a ve presented techniques to enhance fully-adaptive wormhole routing algorithms for fault-tolerant routing in tori.  ... 
doi:10.1145/181181.181330 dblp:conf/ics/ChalasaniB94 fatcat:rjfzyua32vcgvapnc3pqpb7ehy

Compressionless routing

J. H. Kim, Z. Liu, A. A. Chien
1994 SIGARCH Computer Architecture News  
Compressionless Routing (CR) is a new adaptive routing framework which provides a unified framework for efficient deadlock-free adaptive routing and fault-tolerance.  ...  Fault-tolerant Compressionless Routing has several additional advantages: data integrity in the presence of transient faults (nonstop fault-tolerance), permanent faults tolerance, and elimination of the  ...  Additional support has been provided by a generous special-purpose grant from the AT&T Foundation.  ... 
doi:10.1145/192007.192050 fatcat:44ndfht5uzf2zecxkfzip425ha

Compressionless routing: a framework for adaptive and fault-tolerant routing

J.H. Kim, Ziqiang Liu, A.A. Chien
1997 IEEE Transactions on Parallel and Distributed Systems  
Compressionless Routing (CR) is a new adaptive routing framework which provides a unified framework for efficient deadlock-free adaptive routing and fault-tolerance.  ...  Fault-tolerant Compressionless Routing has several additional advantages: data integrity in the presence of transient faults (nonstop fault-tolerance), permanent faults tolerance, and elimination of the  ...  Additional support has been provided by a generous special-purpose grant from the AT&T Foundation.  ... 
doi:10.1109/71.584089 fatcat:ky5xsjitwndo5g7v4fas6zmnom

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  ...  These routing schemes enable a message to reach its destination even in the presence of faults in the network.  ...  ACKNOWLEDGMENTS The author is grateful to Jatin Upadhyay and Vara Varavithya for their help in preparing this article: the comments and suggestions by Professor Lionel Ni have also improved its quality  ... 
doi:10.1145/292469.292472 fatcat:awgtqfbqvjfmvfibgxf3aeqlay

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 planar adaptive routing scheme is an effective deadlock avoidance technique using only three virtual channels for each physical channel in 3D or higher dimensional mesh networks with a very simple  ...  The deadlock-free routing scheme is used to do fault-tolerant routing in meshes, where a new fault model called PN fault model is introduced to guide deadlock-free adaptive fault-tolerant routing in wormhole-routed  ... 
doi:10.1109/tc.2008.211 fatcat:fuk4bfhe2rberll3fgpg3u6tcu

A Survey on Design Approaches to Circumvent Permanent Faults in Networks-on-Chip

Sebastian Werner, Javier Navaridas, Mikel Luján
2016 ACM Computing Surveys  
As a result, fault-tolerant NoC design gained much attention in recent years.  ...  Increasing fault rates in current and future technology nodes coupled with on-chip components in the hundreds calls for robust and fault-tolerant Network-on-Chip (NoC) designs.  ...  In case a link breaks, a contour surrounding around this fault is created, based on which a new routing scheme is defined.  ... 
doi:10.1145/2886781 fatcat:sjckf7spajclnf5tculdoim6dm

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

Jie Wu
2000 IEEE Transactions on Parallel and Distributed Systems  
A su cient condition for minimal routing in 2-D meshes with faulty blocks is proposed.  ...  Our approach is the rst attempt to address adaptive and minimal routing in 2-D meshes with faulty blocks using limited fault information.  ...  Related Work In general, fault-tolerant routing schemes depend on the following four decisions: 1 Type of fault region: convex and concave. 2 Distribution of fault information: local-information, globalinformation  ... 
doi:10.1109/71.841751 fatcat:4cqozl3u2faaxmvmvhpkr4dqcq

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  
In this paper, we show that with a simple modification, the extended X-Y routing can also be applied to 2-D meshes using extended MCCs.  ...  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  ...  In addition, wormhole switching tends to support routing with less fault tolerance. Wormhole routing divides a message into packets and packets into flits.  ... 
doi:10.1080/17445760500033341 fatcat:4ndvnbyrubccroghdpbig4ubyq

Fault-Tolerant Routing in Mesh-Connected 2D Tori [chapter]

Eunseuk Oh, Jong-Seok Kim, Hyeong-Ok Lee
2003 Lecture Notes in Computer Science  
Under the suggested connectivity conditions, we develop efficient routing algorithms in 2D tori with a large number of faulty nodes.  ...  In this paper, we study natural conditions for 2D tori with a large number of faulty nodes to remain connected.  ...  Due to a constant degree of tori and meshes, developing routing algorithms that can only tolerate constant faulty nodes would not be practical.  ... 
doi:10.1007/3-540-44863-2_52 fatcat:wpcbptmxmrfvjkbd3fz7fhobfm

A framework for adaptive routing in multicomputer networks

John Y. Ngai, Charles L. Seitz
1991 SIGARCH Computer Architecture News  
Two convexity-related notions are introduced to characterize the conditions under which our adaptive routing formulation is adequate to provide fault-tolerant routing, with minimal change in routing hardware  ...  fault-tolerant routing.  ...  fault-tolerant routing.  ... 
doi:10.1145/121956.121957 fatcat:ffsmnhjqizautb2rini3orlq5i

Methods for fault tolerance in networks-on-chip

Martin Radetzki, Chaochao Feng, Xueqian Zhao, Axel Jantsch
2013 ACM Computing Surveys  
The article at hand reviews the failure mechanisms, fault models, diagnosis techniques, and fault-tolerance methods in on-chip networks, and surveys and summarizes the research of the last ten years.  ...  It comes with the downside of the circuit elements' increased susceptibility to failure.  ...  Deadlock avoidance or recovery in presence of faults therefore has to be addressed. The new routing scheme originating from adaptation to a fault should preferably be guaranteed deadlock free.  ... 
doi:10.1145/2522968.2522976 fatcat:3t4b3rhbgbc2bphjevpkzlpm6u

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.  ...  contains nodes and only nodes along A FAULT-TOLERANT ADAPTIVE AND MINIMAL ROUTING SCHEME IN n-A sample RMP in 2-D meshes.  ... 
doi:10.1093/comjnl/45.3.349 fatcat:itj2iynr55bipksji2nafesrpa

Fault-tolerant tree-based multicasting in mesh multicomputers

Jie Wu, Xiao Chen
2001 Journal of Computer Science and Technology  
We propose a fault-tolerant tree-based multicast algorithm for 2-dimensional 2-D meshes based on the concept of the extended safety level which i s a v ector associated with each n o d e to capture fault  ...  Our approach is the rst attempt to address the fault-tolerant tree-based multicast problem in 2-D meshes based on limited global information with a simple model and succinct information. 1 In many multicomputer  ...  Most literature on fault-tolerant routing in 2-D meshes uses disconnected rectangular blocks 1 , 2 , 3 , 10 , 29 to model node faults link faults are treated as node faults to facilitate routing in 2-D  ... 
doi:10.1007/bf02948957 fatcat:3x33jzuzunhrdbgiuqm2eq5ueq

Fault-Tolerant Routing in Meshes/Tori Using Planarly Constructed Fault Blocks

Dong Xiang, Jia-Guang Sun, Jie Wu, K. Thulasiraman
2005 International Conference on Parallel Processing (ICPP'05)  
A new concept, called extended local safety information in meshes or tori, is proposed t o guide faulttolerant routing, and classifies fault-free nodes inside 2-dimensional planes.  ...  A few faulty nodes can an n-dimensional mesh or torus network unsafe for fault-tolerant routing methods based on the block fault model, where the whole system space) forms a fault block.  ...  The method in presents a fault-tolerant routing algorithm in 2D meshes or tori.  ... 
doi:10.1109/icpp.2005.40 dblp:conf/icpp/XiangSWT05 fatcat:p43gbxa2sfcqnnawnnz3nqzdpe

Compressionless Routing: a framework for adaptive and fault-tolerant routing

J.H. Kim, Ziqiang Liu, A.A. Chien
Proceedings of 21 International Symposium on Computer Architecture  
Compressionless Routing (CR) is a new adaptive routing framework which provides a unified framework for efficient deadlock-free adaptive routing and fault-tolerance.  ...  Fault-tolerant Compressionless Routing has several additional advantages: data integrity in the presence of transient faults (nonstop fault-tolerance), permanent faults tolerance, and elimination of the  ...  Additional support has been provided by a generous special-purpose grant from the AT&T Foundation.  ... 
doi:10.1109/isca.1994.288141 dblp:conf/isca/KimLC94 fatcat:e4ilzxg6nbaopbhxzcpx7zecni
« Previous Showing results 1 — 15 out of 21 results