313 search results - page 3 / 63 » Computing synchronizer failure probabilities |
TPDS
2010
13 years 4 months ago
2010
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
DSN
2005
IEEE
13 years 11 months ago
2005
IEEE
Designing a distributed fault tolerance algorithm requires careful analysis of both fault models and diagnosis strategies. A system will fail if there are too many active faults, ...
IANDC
2007
13 years 5 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
OPODIS
2010
13 years 3 months ago
2010
Failure detectors are commonly viewed as abstractions for the synchronism present in distributed system models. However, investigations into the exact amount of synchronism encapsu...
SSS
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. We study the problem of global predicate detection in presence of permanent and transient failures. We term the transient failures as small faults. We show that it is imp...