Sciweavers

25 search results - page 1 / 5
» Implementing Fault-Tolerant Services Using State Machines: B...
Sort
View
WDAG
2010
Springer
230views Algorithms» more  WDAG 2010»
13 years 2 months ago
Implementing Fault-Tolerant Services Using State Machines: Beyond Replication
Abstract—This paper describes a method to implement faulttolerant services in distributed systems based on the idea of fused state machines. The theory of fused state machines us...
Vijay K. Garg
ISCAPDCS
2004
13 years 5 months ago
Practical Byzantine Fault Tolerance Using Fewer than 3f+1 Active Replicas
Byzantine fault tolerant state machine replication (BFT-SMR) is a foundation for implementations of highly reliable services. Existing algorithms for BFT-SMR require at least 3f +...
Ming Li, Yuval Tamir
SOSP
2005
ACM
14 years 1 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. ...
SOSP
2005
ACM
14 years 1 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...
SRDS
2007
IEEE
13 years 10 months ago
Customizable Fault Tolerance for Wide-Area Replication
Constructing logical machines out of collections of physical machines is a well-known technique for improving the robustness and fault tolerance of distributed systems. We present...
Yair Amir, Brian A. Coan, Jonathan Kirsch, John La...