Efficient algorithms for analyzing and synthesizing fault-tolerant datapaths

2002 ◽  
Author(s):  
R. Narasimhan ◽  
D.J. Rosenkrantz ◽  
S.S. Ravi
Keyword(s):  
Fault Tolerant ◽  
Efficient Algorithms

DISJOINT-PATHS AND FAULT-TOLERANT ROUTING ON RECURSIVE DUAL-NET

2011 ◽  
Vol 22 (05) ◽  
pp. 1001-1018 ◽  
Author(s):  
YAMIN LI ◽  
SHIETUNG PENG ◽  
WANMING CHU
Keyword(s):  
Fault Tolerant ◽  
Interconnection Network ◽  
Parallel Computers ◽  
Efficient Algorithms ◽  
Disjoint Paths ◽  
Node Degree ◽  
Huge Number ◽  
Critical Issues ◽  
Base Network ◽  
Short Diameter

The recursive dual-net is a newly proposed interconnection network for massive parallel computers. The recursive dual-net is based on recursive dual-construction of a symmetric base network. A k-level dual-construction for k > 0 creates a network containing (2n0)2k/2 nodes with node-degree d0 + k, where n0 and d0 are the number of nodes and the node-degree of the base network, respectively. The recursive dual-net is node and edge symmetric and can contain huge number of nodes with small node-degree and short diameter. Disjoint-paths routing and fault-tolerant routing are fundamental and critical issues for the performance of an interconnection network. In this paper, we propose efficient algorithms for disjoint-paths and fault-tolerant routings on the recursive dual-net.

Efficient algorithms for fault tolerant mobile agent execution

2009 ◽  
Vol 6 (2) ◽  
pp. 106
Author(s):  
Jin Yang ◽  
Jiannong Cao ◽  
Weigang Wu ◽  
Cheng Zhong Xu
Keyword(s):  
Mobile Agent ◽  
Fault Tolerant ◽  
Efficient Algorithms
Sign in / Sign up

Export Citation Format

Share Document