170 search results - page 4 / 34 » Interactive Animation of Fault Tolerant Parallel Algorithms |
IPPS
2009
IEEE
14 years 5 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
IPPS
1999
IEEE
14 years 3 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
1998
IEEE
14 years 3 months ago
1998
IEEE
A non-redundant fault-tolerant broadcasting algorithm in a faulty k-ary n-cube is designed. The algorithm can adapt up to 2n,2 node failures. Compared to the optimal algorithm in a...
ASPDAC
2005
ACM
14 years 25 days ago
2005
ACM
In this paper we propose a fault-tolerant processor architecture and an associated fault-tolerant computation model capable of fault tolerance in the nanoelectronic environment th...
IPPS
1998
IEEE
14 years 3 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, ...