Sciweavers

83 search results - page 2 / 17
» Fault-Tolerant Routing Algorithms for Hypercube Networks
Sort
View
IPPS
1997
IEEE
13 years 9 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
JSA
2000
116views more  JSA 2000»
13 years 4 months ago
A fault tolerant routing algorithm based on cube algebra for hypercube systems
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...
Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan...
IPPS
1997
IEEE
13 years 9 months ago
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
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. ...
Jau-Der Shih
FOCS
1992
IEEE
13 years 9 months ago
On the Fault Tolerance of Some Popular Bounded-Degree Networks
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
Frank Thomson Leighton, Bruce M. Maggs, Ramesh K. ...
ISPAN
2002
IEEE
13 years 10 months ago
Fault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
Sheng-I Yeh, Chang-Biau Yang, Hon-Chan Chen