26 search results - page 1 / 6 » Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Larg... |
172
Voted
CIS
2004
Springer
16 years 26 days ago
2004
Springer
198
Voted
ISCAPDCS
2004
15 years 8 months ago
2004
The dual-cube is a newly proposed interconnection network for linking a large amount of nodes with low node degree. It uses low-dimensional hypercubes as building blocks and keeps...
194
Voted
JSA
2000
15 years 7 months ago
2000
We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
167
click to vote
ISPA
2005
Springer
16 years 29 days ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
214
click to vote
EUROPDS
1997
15 years 8 months ago
1997
In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare nod...