263 search results - page 6 / 53 » Path partitions of hypercubes |
WAE
1998
13 years 8 months ago
1998
In recent years realistic input models for geometric algorithms have been studied. The most important models introduced are fatness, low density, unclutteredness, and small simple...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
IPPS
1997
IEEE
13 years 11 months ago
1997
IEEE
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
ISCAPDCS
2001
13 years 8 months ago
2001
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
ICPADS
2000
IEEE
13 years 11 months ago
2000
IEEE
1 Reliable communication in cube-based multicomputers using the extended safety vector concept is studied in this paper. In our approach, each node in a cube-based multicomputer o...