Journal ArticleDOI
The part-time parliament
Reads0
Chats0
TLDR
The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.Abstract:
Recent archaeological discoveries on the island of Paxos reveal that the parliament functioned despite the peripatetic propensity of its part-time legislators. The legislators maintained consistent copies of the parliamentary record, despite their frequent forays from the chamber and the forgetfulness of their messengers. The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.read more
Citations
More filters
Journal Article
The Blockchain Consensus Layer and BFT
Ittai Abraham,Dahlia Malkhi +1 more
TL;DR: In this article, the authors present analogies and connections between blockchain protocols and Byzantine fault tolerant (BFT) protocols, and also discuss opportunities to consider hybrid solutions for distributed computing systems.
Journal ArticleDOI
Mesa: geo-replicated, near real-time, scalable data warehousing
Ashish Gupta,Fan Yang,Jason Govig,Adam Kirsch,Kelvin K. W. Chan,Kevin Lai,Shuo Wu,Sandeep Govind Dhoot,Abhilash Rajesh Kumar,Ankur Agiwal,Sanjay Bhansali,Mingsheng Hong,Jamie Cameron,Masood Siddiqi,David Jones,Jeff Shute,Andrey Gubarev,Shivakumar Venkataraman,Divyakant Agrawal +18 more
TL;DR: The Mesa system is presented and reports the performance and scale that it achieves, including near real-time data ingestion and queryability, as well as high availability, reliability, fault tolerance, and scalability for large data and query volumes.
Proceedings ArticleDOI
Tashkent+: memory-aware load balancing and update filtering in replicated databases
TL;DR: The memory-aware load balancing technique to dispatch transactions to replicas in a replicated database, MALB, greatly improves performance over other load balancing techniques -- such as round robin, least connections, and locality-aware request distribution -- that do not use explicit information on how transactions use memory.
Journal ArticleDOI
Sinfonia: A new paradigm for building scalable distributed systems
TL;DR: At the core of Sinfonia is a new minitransaction primitive that enables efficient and consistent access to data, while hiding the complexities that arise from concurrency and failures.
Proceedings ArticleDOI
Finding latent performance bugs in systems implementations
TL;DR: This work presents techniques that can automatically pinpoint latent performance bugs in systems implementations, in the spirit of recent advances in model checking by systematic state space exploration, by automating the process of conducting random simulations, identifying performance anomalies, and analyzing anomalous executions to pinpoint the circumstances leading to performance degradation.
References
More filters
Book ChapterDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Journal ArticleDOI
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
Book
Concurrency Control and Recovery in Database Systems
TL;DR: In this article, the design and implementation of concurrency control and recovery mechanisms for transaction management in centralized and distributed database systems is described. But this can lead to interference between queries and updates.
Journal ArticleDOI
Implementing fault-tolerant services using the state machine approach: a tutorial
TL;DR: The state machine approach is a general method for implementing fault-tolerant services in distributed systems and protocols for two different failure models—Byzantine and fail stop are described.
Related Papers (5)
Impossibility of distributed consensus with one faulty process
Unreliable failure detectors for reliable distributed systems
Tushar Deepak Chandra,Sam Toueg +1 more