Sciweavers

271 search results - page 2 / 55
» Distributed Problem Solving In SPite Of Processor Failures
Sort
View
TC
2002
13 years 7 months ago
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
Jean-François Hermant, Gérard Le Lan...
PODC
2009
ACM
14 years 22 hour ago
The weakest failure detector for solving k-set agreement
A failure detector is a distributed oracle that provides processes in a distributed system with hints about failures. The notion of a weakest failure detector captures the exact a...
Eli Gafni, Petr Kuznetsov
WDAG
1998
Springer
107views Algorithms» more  WDAG 1998»
13 years 11 months ago
Transient Fault Detectors
We present fault detectors for transient faults, (i.e. corruptions of the memory of the processors, but not of the code of the processors). We distinguish fault detectors for tasks...
Joffroy Beauquier, Sylvie Delaët, Shlomi Dole...
PODC
2012
ACM
11 years 9 months ago
Asynchronous failure detectors
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
Alejandro Cornejo, Nancy A. Lynch, Srikanth Sastry
PDCAT
2005
Springer
14 years 25 days ago
A New Algorithm to Solve Synchronous Consensus for Dependent Failures
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
Jun Wang, Min Song