Sciweavers

313 search results - page 7 / 63
» Computing synchronizer failure probabilities
Sort
View
EDCC
2010
Springer
15 years 4 months ago
Early Consensus in Message-Passing Systems Enriched with a Perfect Failure Detector and Its Application in the Theta Model
: While lots of consensus algorithms have been proposed for crash-prone asynchronous message-passing systems enriched with a failure detector of the class Ω (the class of eventua...
François Bonnet, Michel Raynal
DSN
2003
IEEE
15 years 5 months ago
Node Failure Detection and Membership in CANELy
Fault-tolerant distributed systems based on fieldbuses may benefit to a great extent from the availabilityof semantically rich communication services,such as those provided by g...
José Rufino, Paulo Veríssimo, Guilhe...
TC
2002
14 years 11 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...
PPL
2000
110views more  PPL 2000»
14 years 11 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
IPPS
1997
IEEE
15 years 3 months ago
A Reliable Hardware Barrier Synchronization Scheme
Barrier synchronization is a crucial operation for parallel systems. Many schemes have been proposed in the literature to achieve fast barrier synchronization through software, ha...
Rajeev Sivaram, Craig B. Stunkel, Dhabaleswar K. P...