90 search results - page 1 / 18 » Fault-tolerant graphs for tori |
CAL
2004
13 years 6 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...
NPC
2004
Springer
13 years 11 months ago
2004
Springer
Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the pre...
EURODAC
1995
IEEE
13 years 9 months ago
1995
IEEE
Distributed systems are becoming a popular way of implementing many embedded computing applications, automotive control being a common and important example. Such embedded systems...
IPPS
2006
IEEE
14 years 8 days ago
2006
IEEE
Graph alliances are recently developed global properties of any symmetric graph. Our purpose in the present paper is to design self-stabilizing fault tolerant distributed algorith...
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...