37 search results - page 8 / 8 » Tolerating Byzantine Faulty Clients in a Quorum System |
INFORMATICALT
2006
13 years 5 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
NSDI
2010
13 years 6 months ago
2010
Byzantine fault-tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. We eliminate this cost for read-mostly ...