Sharper: Sharding permissioned blockchains over network clusters
Scalability is one of the main roadblocks to business adoption of blockchain systems.
Despite recent intensive research on using sharding techniques to enhance the scalability of …
Despite recent intensive research on using sharding techniques to enhance the scalability of …
Time, clocks, and the ordering of events in a distributed system
L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
The concept of one event happening before another in a distributed system is examined,
and is shown to define a partial ordering of the events. A distributed algorithm is given for …
and is shown to define a partial ordering of the events. A distributed algorithm is given for …
The Byzantine generals problem
L Lamport, R Shostak, M Pease - Concurrency: the works of leslie …, 2019 - dl.acm.org
Reliable computer systems must handle malfunctioning components that give conflicting
information to different parts of the system. This situation can be expressed abstractly in …
information to different parts of the system. This situation can be expressed abstractly in …
The part-time parliament
L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
Recent archaeological discoveries on the island of Paxos reveal that the parliament
functioned despite the peripatetic propensity of its part-time legislators. The legislators …
functioned despite the peripatetic propensity of its part-time legislators. The legislators …
Fast paxos
L Lamport - Distributed Computing, 2006 - Springer
As used in practice, traditional consensus algorithms require three message delays before
any process can learn the chosen value. Fast Paxos is an extension of the classic Paxos …
any process can learn the chosen value. Fast Paxos is an extension of the classic Paxos …
A new solution of Dijkstra's concurrent programming problem
L Lamport - Concurrency: the works of leslie lamport, 2019 - dl.acm.org
Knuth [1], deBruijn [2], and Eisenberg and McGuire [3] have given solutions to a concurrent
programming problem originally proposed and solved by Dijkstra [4]. A simpler solution …
programming problem originally proposed and solved by Dijkstra [4]. A simpler solution …
The next 700 BFT protocols
We present Abstract (ABortable STate mAChine replicaTion), a new abstraction for
designing and reconfiguring generalized replicated state machines that are, unlike …
designing and reconfiguring generalized replicated state machines that are, unlike …
The next 700 BFT protocols
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 …
20,000 lines of challenging C++ code encompassing synchronization, networking and …
The heard-of model: computing in distributed systems with benign faults
B Charron-Bost, A Schiper - Distributed Computing, 2009 - Springer
Problems in fault-tolerant distributed computing have been studied in a variety of models.
These models are structured around two central ideas:(1) degree of synchrony and failure …
These models are structured around two central ideas:(1) degree of synchrony and failure …
The mutual exclusion problem: part I---a theory of interprocess communication
L Lamport - Concurrency: the Works of Leslie Lamport, 2019 - dl.acm.org
A novel formal theory of concurrent systems that does not assume any atomic operations is
introduced. The execution of a concurrent program is modeled as an abstract set of …
introduced. The execution of a concurrent program is modeled as an abstract set of …