JP Martin, L Alvisi - IEEE Transactions on Dependable and …, 2006 - ieeexplore.ieee.org
We present the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case. We prove that our protocol is optimal in terms of …
We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for designing and reconfiguring generalized replicated state machines that are, unlike …
J Kirsch, Y Amir - Proceedings of the 2nd Workshop on Large-Scale …, 2008 - dl.acm.org
This paper presents an overview of Paxos for System Builders, a complete specification of the Paxos replication protocol such that system builders can understand it and implement it …
R Guerraoui, N Knežević, V Quéma… - Proceedings of the 5th …, 2010 - dl.acm.org
Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20,000 lines of challenging C++ code encompassing synchronization, networking and …
M Poke, T Hoefler - Proceedings of the 24th International Symposium on …, 2015 - dl.acm.org
The increasing amount of data that needs to be collected and analyzed requires large-scale datacenter architectures that are naturally more susceptible to faults of single components …
We consider the problem of making apps fault-tolerant through replication, when apps operate at the microsecond scale, as in finance, embedded computing, and microservices …
In modern computing a program is usually distributed among several processes. The fundamental challenge when developing reliable distributed programs is to support the …
Distributed consensus is fundamental to building fault-tolerant systems. It allows a collection of machines to work as a coherent group that can survive the failures of some of its …
Distributed systems play a crucial role in modern infrastructure, but are notoriously difficult to implement correctly. This difficulty arises from two main challenges:(a) correctly …