Sciweavers

716 search results - page 75 / 144
» Tolerating Faults in Synchronization Networks
Sort
View
NCA
2008
IEEE
15 years 6 months ago
Failure, Disconnection and Partition Detection in Mobile Environment
In mobile environment, nodes can move around and voluntarily leave or join the network. Furthermore, they can crash or be disconnected from the network due to the absence of netwo...
Denis Conan, Pierre Sens, Luciana Arantes, Mathieu...
DSN
2000
IEEE
15 years 4 months ago
Dynamic Byzantine Quorum Systems
Byzantine quorum systems [13] enhance the availability and efficiency of fault-tolerant replicated services when servers may suffer Byzantine failures. An important limitation of...
Lorenzo Alvisi, Evelyn Tumlin Pierce, Dahlia Malkh...
SOSP
2005
ACM
15 years 8 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
SPIN
2000
Springer
15 years 3 months ago
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
Nicholas Weininger, Darren D. Cofer
PVM
2010
Springer
14 years 10 months ago
Dodging the Cost of Unavoidable Memory Copies in Message Logging Protocols
Abstract. With the number of computing elements spiraling to hundred of thousands in modern HPC systems, failures are common events. Few applications are nevertheless fault toleran...
George Bosilca, Aurelien Bouteiller, Thomas H&eacu...