A distributed commit protocol for a multicomputer system

Ancilotti, Paolo; Lazzerini, Beatrice; Prete, Cosimo Antonio; Sacchi, Marco

doi:10.1109/12.53589

Cited by 6 publications

(5 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our protocol blocks only in situations when we do not have more than half of the coordinators which are working or in an unknown state in one network partition. However, this blocking in split asynchronous networks has been proved to be unavoidable ( [1]). …”

Section: Discussionmentioning

confidence: 99%

“…In the second case, when we cannot exclude network partitioning, [1] proved that there exists no non-blocking atomic commit protocol. However, if network partitioning occurs, we want our protocol to minimize the number of blocked databases and coordinators.…”

Section: Requirementsmentioning

confidence: 97%

“…If we cannot exclude or safely detect a network partitioning, our protocol needs ( 1 2 f + 1) coordinators to be running in the same network partition to get a commit decision for the transaction. Otherwise, [1] proved that it is inevitable to wait until the network is connected again. In this case, the number of remaining coordinators is the same as that in the Paxos Commit Protocol.…”

Section: Related Workmentioning

confidence: 98%

“…This atomic transaction commitment is necessary to deal with concurrent transactions in complex systems like distributed databases, peerto-peer systems, and service oriented architectures. 1 The problems like message delay, disconnection of nodes, and network partitioning have been studied and a 1 This work was supported in part by National Science Foundation Grant No. IIS-0312746 number of solutions have been proposed to solve these problems.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

An integrated commit protocol for mobile network databases

Böse

Obermeier

Böttcher

et al. 2005

9th International Database Engineering &Amp; Application Symposium (IDEAS'05)

View full text Add to dashboard Cite

While traditional fixed-wired network protocols like 2-Phase-Commit guarantee atomicity, we cannot use them in mobile low bandwidth networks where network partitioning, node failure, and message loss may result in blocking. To deploy traditional database applications easily into a mobile environment, there is a demand for a protocol which guarantees an atomic commit of transactions. This paper introduces a protocol which can guarantee such atomic commitment in mobile environments using a combination of commit and consensus protocols. In addition, it takes advantage of mobile network sub-structures like single-hopenvironments to reduce message transfer costs.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Requirementsmentioning

confidence: 97%

Section: Related Workmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An integrated commit protocol for mobile network databases

Böse

Obermeier

Böttcher

et al. 2005

9th International Database Engineering &Amp; Application Symposium (IDEAS'05)

View full text Add to dashboard Cite

show abstract

“…Distributed transaction processing (DTP) and object transaction service (OTS) are two atomic transaction models widely used in the traditional distributed environment, where consistent actions among transaction participants are achieved by commit protocols [7]. One of well-known distributed commit protocols is the two-phase commit (2PC) [8].…”

Section: Related Workmentioning

confidence: 99%

Transaction Management for Reliable Grid Applications

Tang

Guo

et al. 2009

2009 International Conference on Advanced Information Networking and Applications

View full text Add to dashboard Cite

Transaction management in Grids is responsible for ensuring the reliable execution of inherently distributed Grid applications. Grid transaction management is different from existing distributed transaction models because Grid resources are highly autonomous, dynamic and heterogeneous. This paper proposes a Grid transaction service (GridTS) and coordination algorithms that manage short-lived and longlived Grid transactions respectively, providing reliability support for Grid applications. Unlike existing long-lived transaction models that require application programmers to develop compensating transactions, the GridTS can automatically generate compensating transactions during the execution of long-lived Grid transactions. The feasibility of GridTS and the effectiveness of proposed coordination algorithms are demonstrated through simulation studies.

show abstract