Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 788 papers for “two-phase commit”

A New Presumed Commit Optimization for Two Phase Commit

Butler Lampson And, Butler Lampson, David Lomet · 1993

Two phase commit (2PC) is used to coordinate the commitment of transactions in distributed systems. The standard 2PC optimization is the presumed abort variant, which uses fewer messages when transactions are aborted and allows the coordinator to forget about aborted transactions. The presumed commit variant of 2PC uses even fewer messages, but its coordinator must do additional logging. We describe a new form of presumed commit that reduces the number of log writes while preserving the reduction in messages, bringing both these costs below those of presumed abort. The penalty for this is the need to retain a small amount of crash related information forever. 1 Introduction 1.1 Coordinating Distributed Commit Distributed systems rely on the two phase commit (2PC) protocol to coordinate the commitment of transactions [1, 4]. 2PC guarantees the atomicity of distributed transactions, that is, that all cohorts of a transaction either commit or abort the transaction. The cost of 2PC is an...

Cited by 0

Analysis and Verification of Two-Phase Commit & Three-Phase Commit Protocols

Atif, M Muhammad · TU/e Research Portal (Eindhoven University of Technology) · 2009

Abstract—This paper introduces a formal model of the dis-tributed commit protocols in the process algebra mCRL2 and also their general requirements in the modal µ-calculus. We show how to make straightforward models of protocols and by doing so, how it becomes easy to identify problems. We apply this to the well-known Two-Phase Commit Protocol (2PC) and prove it problematic for single site failure. We also apply our method to its “amended ” variant, the Three-Phase Commit Protocol (3PC) and prove it to be erroneous for simultaneous site failures. We present 2PC and 3PC in different communication settings and verify them with respect to their requirements. I.

Cited by 0

The presumed-either two-phase commit protocol

Gopi K. Attaluri, Kenneth Salem · IEEE Transactions on Knowledge and Data Engineering · 2002

This paper describes the presumed-either two-phase commit protocol. Presumed-either exploits log piggybacking to reduce the cost of committing transactions. If timely piggybacking occurs, presumed-either combines the performance advantages of presumed-abort and presumed-commit. Otherwise, presumed-either behaves much like the widely-used presumed-abort protocol.

Cited by 24

Non‐blocking two‐phase commit using blockchain

Paul Ezhilchelvan, Amjad Aldweesh, Aad van Moorsel · Concurrency and Computation Practice and Experience · 2019

Summary The two‐phase commit (2PC) protocol has long been known to have a provably inevitable vulnerability to blocking or non‐progress amidst server crashes, even when the distributed database system guarantees the most demanding timing‐related or “synchrony” requirements. Our aim here is to eliminate this vulnerability by using a blockchain for coordinating 2PC execution. We present the impossibilities, the possibilities, the cost, and the trade‐offs in this blockchain‐based approach to blocking‐free management of distributed transactions. We prove that a non‐blocking and blockchain‐coordinated 2PC protocol can exist only if both the blockchain and distributed database systems meet synchrony requirements; otherwise, although blocking remains eliminated, transactions can unnecessarily abort. We present a blockchain‐coordinated 2PC protocol and provide rigorous arguments for its correctness under the synchrony requirements. We then implement this protocol on the Ethereum Testnet and demonstrate, through our experiments, that the monetary cost of executing smart contracts is quite small, that the protocol performance slows down when using a public blockchain like Ethereum, and that even major violations of synchrony requirements lead only to relatively small increases in unnecessary aborts. We thus identify a trade‐off between improving protocol performance and admitting a risk that transactions could occasionally abort unnecessarily.

Cited by 4

Using timestamping to optimize two phase commit

David Lomet · 2002

The two-phase commit (2PC) protocol is used to guarantee the serializability of distributed transactions. The message cost of the standard 2PC has led to efforts to optimize the protocol and reduce the number of messages required. The common optimizations require that each cohort of a transaction be terminated (finished with normal accessing of data) in order for these optimizations to lead to serial schedules. The use of timestamps is suggested as a substitute for knowing when cohorts are terminated, and it is shown how the 2PC protocol itself can be used to choose the timestamps. The key to this is to permit cohorts to vote transaction time ranges within which the transaction must commit or else be aborted. Using time ranges, the read only optimization and early release of read locks can be supported. The transaction times chosen are appropriate for identifying versions of data in a multiversion rollback database.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 15

Two-Phase Commit in Gigabit-Networked Distributed Databases

Yousef J. Al-houmaily, Panos K. Chrysanthis · 1995

In the future, different database sites will be interconnected via gigabit networks, forming a very powerful distributed database system. In such an environment, the propagation latency will be the dominant component of the overall communication cost while the migration of large amount of data will not pose a problem. Furthermore, computer systems are expected to become highly reliable. In this paper, we present a two-phase commit variant that exploits these new domain characteristics to minimize the cost of distributed transaction commitment. Although the protocol trades off efficiency during normal processing for slower recovery, it supports forward recovery that potentially reduces the overall cost of recovery. 1 Introduction Transactions in a distributed environment access data located at different sites. Part of the correctness of a distributed transaction is to ensure its atomicity which requires that all the transaction&amp;apos;s effects either persist at all the sites the transactio...

Cited by 0

The Two Phase Commit Protocol in π-Calculus

Fan Zhang · 2006

The two phase commit protocol is the simplest and most popular atomic commitment protocol (ACP). It makes the transaction commitment in the distributed systems have atomicity and durability. In this paper, we use the π-calculus to describe the two phase commit protocol, and prove the correctness, and also incarnate the unique predominance of π-calculus in description of process communication and parallelism.

Cited by 0

A two-phase commit protocol for mobile wireless environment

Nadia Nouali, Anne Doucet, Habiba Drias et al. · 2005

The challenges of wireless and mobile computing environments have attracted the attention of researchers to revisit the conventional implementation of distributed computing paradigms. In this paper we propose to revisit the conventional implementation of the Two Phase Commit (2PC) protocol which is a fundamental asset of transactional technology for ensuring the consistent commitment of distributed transactions. We propose a new execution framework providing an efficient extension that is aware of the mobility. The proposed M-2PC (Mobile 2PC) protocol preserves the 2PC principle and the freedom of the mobile clients and servers while it minimizes the impact of unreliable wireless communications. Keywords: Two-phase commit protocol, Mobile transaction processing, Handoff, Disconnection.

Cited by 45

Serializability and Heterogeneous Trust from Two Phase Commit to Blockchains

Sheff, Isaac Cameron · eCommons (Cornell University) · 2019

As distributed systems become more federated and cross-domain, we are forced to rethink some of our core abstractions. We need heterogeneous systems with rigorous consistency and self-authentication guarantees, despite a complex landscape of security and failure tolerance assumptions. I have designed, built, and evaluated heterogeneous distributed algorithms with broad applications from medical privacy to blockchains. This dissertation examines three novel building blocks for this vision. First, I show that serializable transactions cannot always be securely scheduled when data has different levels of confidentiality. I have identified a useful subset of transactions that can always be securely scheduled, and built a system to check and execute them. Second, I present Charlotte, a heterogeneous system that supports composable Authenticated Distributed Data Structures (like Git, PKIs, or Bitcoin). I show that Charlotte produces significant performance improvements compared to a single, universally trusted blockchain. Finally, I develop a rigorous generalization of the consensus problem, and present the first distributed consensus which tolerates heterogeneous failures, heterogeneous participants, and heterogeneous observers. With this consensus, cross-domain systems can maintain ADDSs, or schedule transactions, without the expensive overhead that comes from tolerating the sum of everyone?s fears.

Cited by 0Open access

An Alternative Model to Overcoming Two Phase Commit Blocking Problem

Sheikh Salah, Hassan Jafar; Computer Science, Jomo Kenyatta University of Agriculture and Technology Kenya, M. Rimiru, Dr. Richard; Computer Science, Jomo Kenyatta University of Agriculture and Technology Kenya, W. Kimwele, Dr. Michael; Computer Science, Jomo Kenyatta University of Agriculture and Technology Kenya · Global Society of Scientific Research and Researchers - International Journal of Computer · 2017

Cited by 0Open access

Design and Implementation of a Two-Phase Commit Protocol Simulator

Toufik Taibi, Abdelouahab Abid, Wei Jiann Lim et al. · 2004

Abstract: The Two-Phase Commit Protocol (2PC) is a set of rules, which guarantee that every single transaction in a distributed system is executed to its completion or none of its operations is performed. To show the effectiveness of 2PC, a generic simulator is designed and implemented to demonstrate how transactions are committed in a safe manner, and how data consistency is maintained in a distributed system with concurrent execution of randomly generated transactions. Several possible failure cases are identified and created in the system to test its integrity, thus showing how well it responds to different failure scenarios, recovers from these failures, and maintains data consistency and integrity. The simulator was developed using Java Remote Method Invocation (RMI), which is particularly powerful in developing networking systems of such scale, as it provides easy remote method calls without the need to handle low-level socket connection. Keywords: 2PC, transaction coordinator, transaction manager, data manager, locking manager, failure recovery, RMI.

Cited by 0

A dynamic two-phase commit protocol for self-adapting services

Weihai Yu, Yan Wang, Calton Pu · 2004

Next-generation applications based on Web services impose additional requirements on the use of coordination protocols with various optimizations, such as the two-phase commit protocol (2PC). We analyse the well-known 2PC optimizations presumed commit and presumed abort, and present an improved 2PC that is suitable for Web services based applications. More specifically, the protocol allows every individual service provider to choose dynamically the most appropriate presumption for any distributed transaction. The protocol does not introduce extra overhead to the previous 2PC variants in terms of number of messages and log records, and it is easy to understand and realize.

Cited by 5

oxir Kl LIBRARIES Implementation of the Two-Phase Commit Protocol in

Andrew Kirmse, Barbara Liskov, Jr. Morgenthaler et al. · 1995

This thesis describes the detailed design and implementation of the two-phase commit protocol for Thor, a new object-oriented database management system. The protocol relies on an optimistic concurrency control scheme and loosely synchronized clocks for transaction validation. It incorporates a number of performance optimizations, including presumed abort, short-circuited prepare, the coordinator log protocol, and further optimization of read-only transactions. The thesis also discusses some features of the protocol unique to Thor, such as client cache invalidation and the assignment

Cited by 0

Performance evaluation of a two-phase commit based protocol for DDBs

Daniel A. Menascé, Tatuo Nakanishi · 1982

Many concurrency control algorithms for distributed database management systems have been proposed in the last few years, but little has been done to analyse their performance. This paper presents the specification of a concurrency control algorithm based on the two-phase commit protocol for DDBs. The results of a complete performance analysis based on an analytic model are presented and discussed.

Cited by 0Open access