Fault-tolerant broadcasting in wormhole-routed torus networks

2002 ◽  
Author(s):  
Seungjin Park ◽  
S. Seidel ◽  
Jong-Hoon Youn
Keyword(s):  
Fault Tolerant ◽  
Torus Networks ◽  
Wormhole Routed

scholarly journals A fault-tolerant routing algorithm for wormhole routed meshes

2000 ◽  
Vol 26 (4) ◽  
pp. 455-465 ◽  
Author(s):  
Pao-Hwa Sui ◽  
Sheng-De Wang
Keyword(s):  
Fault Tolerant ◽  
Routing Algorithm ◽  
Wormhole Routed

Optimal multicast communication in wormhole-routed torus networks

1995 ◽  
Vol 6 (10) ◽  
pp. 1029-1042 ◽  
Author(s):  
D.F. Robinson ◽  
P.K. McKinley ◽  
B.H.C. Cheng
Keyword(s):  
Multicast Communication ◽  
Torus Networks ◽  
Wormhole Routed

scholarly journals Conditional Fault-Diameter of Torus Networks

2005 ◽  
Vol 10 ◽  
pp. 51
Author(s):  
Abderezak Touzene ◽  
Khaled Day
Keyword(s):  
Interconnection Networks ◽  
Fault Tolerant ◽  
Interconnection Network ◽  
Routing Algorithms ◽  
Star Graph ◽  
Faulty Processor ◽  
Node Connectivity ◽  
Fault Diameter ◽  
Torus Networks ◽  
Vertex Disjoint

We obtain the conditional fault-diameter of the square torus interconnection network under the condition of forbidden faulty sets (i.e. assuming that each non-faulty processor has at least one non-faulty neighbor). We show that under this condition, the square torus, whose connectivity is 4, can tolerate up to 5 faulty nodes without becoming disconnected. The conditional node connectivity is, therefore, 6. We also show that the conditional fault-diameter of the square torus is equal to the fault-free diameter plus two. With this result the torus joins a group of interconnection networks (including the hypercube and the star-graph) whose conditional fault-diameter has been shown to be only two units over the fault-free diameter. Two fault-tolerant routing algorithms are discussed based on the proposed vertex disjoint paths construction.  

Sign in / Sign up

Export Citation Format

Share Document