Niobe: A practical replication protocol
ACM Transactions on Storage (TOS)
Holistic aggregate resource environment
ACM SIGOPS Operating Systems Review
A platform for cooperative server backups based on virtual machines
ISAS'08 Proceedings of the 5th international conference on Service availability
Increasing performance in byzantine fault-tolerant systems with on-demand replica consistency
Proceedings of the sixth conference on Computer systems
ZZ and the art of practical BFT execution
Proceedings of the sixth conference on Computer systems
CheapBFT: resource-efficient byzantine fault tolerance
Proceedings of the 7th ACM european conference on Computer Systems
Gnothi: separating data and metadata for efficient and available storage replication
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Leveraging sharding in the design of scalable replication protocols
Proceedings of the 4th annual Symposium on Cloud Computing
| Hi-index | 0.00 |
Asynchronous algorithms for implementing a fault-tolerantdistributed system, which can make progressdespite the failure of any F processors, require 2F + 1processors. Cheap Paxos, a variant of the Paxos algorithm,guarantees liveness under the additional assumptionthat the set of nonfaulty processors does not"jump around" too fast, but uses only F + 1 main processorsthat actually execute the system and F auxiliaryprocessors that are used only to handle the failure of amain processor. The auxiliary processors take part inreconfiguring the system to remove the failed processor,after which they can remain idle until another mainprocessor fails.