83 search results - page 5 / 17 » Fault-Tolerant Routing Algorithms for Hypercube Networks |
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
: Cluster systems gain more and more importance as a platform for parallel computing. In this area the power of the system is strongly coupled with the performance of the network, ...
HICSS
2008
IEEE
13 years 7 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
ISPA
2005
Springer
14 years 1 months 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...
SAINT
2005
IEEE
14 years 1 months ago
2005
IEEE
New application scenarios, such as Internet-scale computations, nomadic networks and mobile systems, require decentralized, scalable and open infrastructures. The peerto-peer (P2P...
CAL
2004
13 years 7 months ago
2004
In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade...