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 268 papers for “Two-phase commit protocol”

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

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

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

Analysis of a storage channel in the two phase commit protocol

Oliver Costich, Ira S. Moskowitz · 2002

The authors discuss how a noisy storage channel arises in the two phase commit protocol. The analysis is done through Shannon's information theory. They discuss how large the channel is and offer suggestions on how to diminish the channel capacity.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Cited by 14

Reducing the blocking in two-phase commit protocol employing backup sites

P. Krishna Reddy, Masaru Kitsuregawa · 1998

In distributed database systems (DDBSs), a transaction blocks during two-phase commit (2PC) processing if the coordinator site fails and at the same time some participant site has declared itself ready to commit the transaction. The blocking phenomena reduces availability of the system since the blocked transactions keep all the resources until they receive the final command from the coordinator after its recovery. To remove the blocking problem in 2PC protocol, the three phase commit (3PC) protocol was proposed. Although 3PC protocol eliminates the blocking problem, it involves an extra round of message transmission, which further degrades the performance of DDBSs. We propose a backup commit (BC) protocol by including a backup phase to 2PC protocol. In this, one backup site is attached to each coordinator site. After receiving responses from all participants in the first phase, the coordinator communicates its decision only to its backup site in the backup phase. Afterwards, it sends a final decision to participants. When blocking occurs due to the failure of the coordinator site, the participant sites consult the coordinator's backup site and follow termination protocols. In this way, BC protocol achieves a non-blocking property in most of the coordinator site failures. However, in the worst case, the blocking can occur in BC protocol when both the coordinator and its backup site fail simultaneously. If such a rare case occurs, the participants wait until the recovery of either the coordinator site or the backup site. BC protocol suits DDBS environments in which sites fail frequently and messages take longer delivery time. Through simulation experiments it is shown that BC protocol exhibits superior throughput and response time performance over 3PC protocol and performs closely with 2PC protocol.

Cited by 25

A Model Application of Two Phase Commit Protocol in Wireless DTN

Ghewari M.U, D. K. · International Journal of Computer Applications · 2017

The requirements of high band width data spectrum and its efficient high speed transmission is the challenge which is exponentially rising due to the automation of all kinds of electrical and electronic gadgets. Currently most of the local area networks are adhoc due to which connectivity is a serious problem. The currently used DTN has several problems of call drop and data failure. Recently two phase commit protocol has been proposed which has high potential to overcome the problems of call drop. Two phase commit protocol on deployment in real time scenario has been analyzed for the DTN networks and we found most astonishing results in the improvement of the routing paradigm as compared to DSR and AODV protocols for routing throughput and for average end to end delay. This paper analyzes two phase commit protocol running in two different phases on deploying the DTN wireless scenario for heterogeneous network infrastructure and measures the effects successfully.

Cited by 3Open access

Cross shard leader accountability protocol based on two phase atomic commit

Zhiqiang Du, Wendong Zhang, Liangxin Liu et al. · Scientific Reports · 2024

Sharding blockchain is a technology designed to improve the performance and scalability of traditional blockchain systems. However, due to its design, communication between shards depends on shard leaders for transmitting information, while shard members are unable to detect communication activities between shards. Consequently, Byzantine nodes can act as shard leaders, engaging in malicious behaviors to disrupt message transmission. To address these issues, we propose the Cross shard leader accountability protocol (CSLAP), which is based on the two-phase atomic commit protocol (2PC). CSLAP employs byzantine broadcast/byzantine agreement (BB/BA) for Byzantine fault tolerance to generate cross-shard leader re-election certificates, thereby reducing the impact of shard leaders on inter-shard communication. It also uses Round-robin mechanism to facilitate leader re-election. Moreover, we demonstrate that CSLAP maintains the security and liveness of sharding transactions while providing lower communication latency. Finally, we conducted an experimental comparison between CSLAP and other cross-shard protocols. The results indicate that CSLAP exhibits superior performance in reducing communication latency.

Cited by 1Open access

Coloured Petri Net Model of Two-Phase Commit Protocol With Multiple Participants

Iwaniak, M., Khadzhynov, W. · The scientific electronic library of periodicals of the National Academy of Sciences of Ukraine (National Academy of Sciences of Ukraine) · 2013

In this work the usage of Coloured Petri Net for modeling and simulation of Two Phase Commit protocol with multiple cohorts is presented. Brief overview of Coloured Petri Nets is introduced. Two-Phase Commit protocol is briefly described than introduced as Coloured Petri Net model. By initial marking adaptation a few scenarios for 2PC protocol are presented with the use of the reachability analysis.

Cited by 0Open access

Early Conflict Checking in Two-Phase Commit Protocol for Replicated State Machines

Halit Uyanık, Tolga Ovatman · International Journal of Distributed Systems and Technologies · 2021

Representing an algorithmic workflow as a state machine is a frequently used technique in distributed systems. Replicating a state machine in a fault tolerant way is one of the main application areas under this context. When implementing a replicated state machine, a crucial problem is to maintain consistency among replicas that might handle various different requests arriving at each different replica. This problem requires maintaining a single consistent ordering of the distributed requests handled separately by replicas. Basic consensus protocols such as two-phase commit (2PC) can be used to maintain consistency between replicas whenever a request is to be processed. In this study, the authors modify 2PC protocol to take advantage of basic properties of a state machine and detect possible write conflicts earlier. The experiments on distributed cloud environments show that the modified 2PC protocol increases the throughput and decreases wasted write operations by a significant amount.

Cited by 0