Using optimistic atomic broadcast in transaction processing systems
TL;DR: In this paper, the authors present a replicated database architecture that employs the new atomic broadcast primitive in such a way that communication and transaction processing are fully overlapped, providing high performance without relaxing transaction correctness.
read more
Abstract: Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. Recently, a new approach has been proposed for atomic broadcast which, based on optimistic assumptions about the communication system, reduces the average delay for message delivery to the application. We develop this idea further and show how applications can take even more advantage of the optimistic assumption by overlapping the coordination phase of the atomic broadcast algorithm with the processing of delivered messages. In particular, we present a replicated database architecture that employs the new atomic broadcast primitive in such a way that communication and transaction processing are fully overlapped, providing high performance without relaxing transaction correctness.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Total order broadcast and multicast algorithms: Taxonomy and survey
TL;DR: Total order broadcast and multicast (also called atomic broadcast/multicast) present an important problem in distributed systems, especially with respect to fault-tolerance.
Fast Byzantine Consensus
TL;DR: This work presents the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case and shows a parameterized version of the protocol that is safe despite f Byzantine failures and guarantees two-step execution despite some number of failures.
353
Fast Byzantine consensus
Jean-Philippe Martin,Lorenzo Alvisi +1 more
- 28 Jun 2005
TL;DR: This work presents the first protocol that reaches asynchronous Byzantine consensus in two communication steps in the common case and shows a parameterized version of the protocol that is safe despite f Byzantine failures and guarantees two-step execution despite some number of failures.
•Book
Synthesis Lectures on Data Management
M. Tamer Özsu
- 01 Jan 2010
TL;DR: This lecture gives an overview of recent research in stream processing, ranging from answering simple queries on high-speed streams to loading real-time data feeds into a streaming warehouse for off-line analysis.
•Journal Article
Consistent Database Replication at the Middleware Level
TL;DR: This paper presents different replication protocols, argues their correctness, describes their implementation as part of a generic middleware tool, and proves their feasibility with an extensive performance evaluation.
References
•Book
Concurrency Control and Recovery in Database Systems
Philip A. Bernstein,Vassco Hadzilacos,Nathan Goodman +2 more
- 01 Feb 1987
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.
4.2K
•Book
Transaction Processing: Concepts and Techniques
Jim Gray,Andreas Reuter +1 more
- 01 Jan 1992
TL;DR: Using transactions as a unifying conceptual framework, the authors show how to build high-performance distributed systems and high-availability applications with finite budgets and risk.
3.8K
Unreliable failure detectors for reliable distributed systems
Tushar Deepak Chandra,Sam Toueg +1 more
TL;DR: It is proved that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast.
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.
Virtual time
TL;DR: Virtual time is a new paradigm for organizing and synchronizing distributed systems which can be applied to such problems as distributed discrete event simulation and distributed database concurrency control.
2.3K