Sciweavers

20 search results - page 4 / 4
» Fault-scalable Byzantine fault-tolerant services
Sort
View
EUROSYS
2008
ACM
14 years 8 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
DSN
2005
IEEE
14 years 4 months ago
Design Time Reliability Analysis of Distributed Fault Tolerance Algorithms
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, ...
Elizabeth Latronico, Philip Koopman
SOSP
2005
ACM
14 years 7 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. ...
SRDS
2007
IEEE
14 years 5 months ago
The Fail-Heterogeneous Architectural Model
Fault tolerant distributed protocols typically utilize a homogeneous fault model, either fail-crash or fail-Byzantine, where all processors are assumed to fail in the same manner....
Marco Serafini, Neeraj Suri
SOSP
2007
ACM
14 years 7 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...