26 search results - page 2 / 6 » Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Larg... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
In this paper the problem of fault-tolerant message routing in two-dimensional meshes, with each inner node having 4 neighbors, is investigated. It is assumed that some nodes/links...
IPPS
2002
IEEE
14 years 12 days ago
2002
IEEE
In this paper, a fault-tolerant routing in 2-D meshes with dynamic faults is provided. It is based on an early work on minimal routing in 2-D meshes with static faults. Unlike man...
ICPP
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with k j ...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routin...