no code implementations • 25 Feb 2021 • Petr Kuznetsov, Andrei Tonkikh, Yan X Zhang
In this paper, we present a fast Byzantine consensus algorithm that relies on just $5f-1$ processes.
Distributed, Parallel, and Cluster Computing
1 code implementation • 13 Jun 2019 • Rachid Guerraoui, Petr Kuznetsov, Matteo Monti, Matej Pavlovic, Dragos-Adrian Seredinschi
As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spending; this is usually solved by achieving consensus on the order of transfers among the participants.
Distributed, Parallel, and Cluster Computing
1 code implementation • 5 Feb 2015 • Vitaly Aksenov, Vincent Gramoli, Petr Kuznetsov, Srivatsan Ravi, Di Shang
Designing an efficient concurrent data structure is an important challenge that is not easy to meet.
Distributed, Parallel, and Cluster Computing
