• Title/Summary/Keyword: TWO PHASE COMMIT

Search Result 12, Processing Time 0.02 seconds

Non-Blocking Two Phase Commit Protocol using Cascade Coordinator in Distributed Database System (분산데이터베이스 시스템에서 연쇄 조정자를 이용한 2단계 완료 규약)

  • 안인순;김경창
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.275-277
    • /
    • 2000
  • 분산 데이터베이스 시스템에서 데이터의 일치성을 유지하기 위해 원자성 완료 규약을 수행한다. 2PC 규약은 규약 수행시 조정자의 고장으로 인하여 참여자들이 블록킹이 될 수 있다. 참여자들이 블록킹되는 것은 자신들의 자원을 풀지 못하고 조정자가 고장에서 복구될 때까지 기다려야 한다. 블록킹을 해결하기 위해 제안된 방법은 3PC(Three Phase Commit Protocol)규약이 대표적이다. 이 규약은 블록킹은 해결하지만 2PC(Two Phase Commit) 규약보다 많은 메시기 교환과 로그 기록을 하게 되고 따라서 규약을 수행하는 데 걸리는 시간이 증가된다. 본 논문에서는 2PC 규약의 변형으로 블록킹을 해결할 수 있는 기법을 제안하므로써 기존의 3PC 규약보다 수행시간을 향상시킨다. 제안하는 완료규약의 특징은 새로운 조정자를 규약 전에 미리 선출하여 조정자 고장 발생시 종료규약을 수행하게 함으로써 블록킹을 해결하였다.

  • PDF

Non-Blocking Two Phase Commit Protocol Reducing the Blocking Problem (봉쇄문제를 축소한 비봉쇄 이단계 완료규약)

  • An, In-Sun;Kim, Gyeong-Chang
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.523-532
    • /
    • 2001
  • An atomic commitment protocol ensures that distributed transcations terminate consistently at participating sites. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite of failure in the coordinator site and communication. It is well known that the famous two phase commit(2PC) is a blocking protocol, whereas the three phase commit(3PC) protocol is a non-blocking. In this paper, we propose a non-blocking two phase commit(NB-2PC) protocol reducing the blocking problem than propose non-blocking protocols. The NB-2PC protocol can be obtained through modifications of the 2PC protocol. After receiving Prepare message from coordinator in the NB-2PC protocol, participants respond to the coordinator and several participants in voting phase. While participants wait for decision message from the coordinator, the blocking occurs due to the failure of the coordinator site, participants elect new coordinator among several participants receive response message. Despite of the coordinator site failures, participants consult new coordinator and follow termination protocols and achieve non-blocking property. We propose a basic structure of NB-2PC protocol and termination protocol and new coordinator election protocol. The NB-2PC protocol has non-blocking property and reduces processing time of commit protocol than the 3PC protocol. Also, through simulation experiments, we propose the NB-2PC protocol exhibits better performance of processing time of commit protocol than 3PC protocol.

  • PDF

Efficient EPC(Enhanced Presumed Commit) Protocol in Distributed Database System (분산 데이터베이스 시스템에서 효율적인 EPC 규약)

  • 안인순;김경창
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10a
    • /
    • pp.349-351
    • /
    • 1999
  • 분산 데이텁이스 시스템에서 원자성 완료 규약으로 2PC(Two Phase Commit) 규약을 사용한다. 2PC 규약의 단점은 규약 수행시 조정자의 고장으로 인하여 참여자들이 블록킹이 될 수 있다. 참여자들이 블록킹 되는 것은 자신들의 자원을 풀지 못하고 조정자가 고장에 복구될 때 까지 기다려야 한다. 블록킹을 해결하기 위해 제안된 방법은 3PC(Three Phase Commit Protocol)규약이 대표적이다. 이 규약은 블록킹은 해결하지만 2PC 규약보다 많은 메시지 교환과 로그 기록을 하게 되고 규약을 수행하는데 걸리는 시간이 증가된다. 본 논문에서는 2PC 규약을 향상시킨 EPC(Enhanced Presumed Commit)규약에 블록킹을 해결할 수 있는 기법을 제안하므로써 기존의 3PC 규약보다 수행시간을 향상시킨다.

  • PDF

Efficient Method of Processing Long-term Transactions for Distributed Environment (분산 환경에서 장기 트랜잭션의 효율적인 처리 방안)

  • 정지호;엄기환
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.1007-1014
    • /
    • 2003
  • It is important to integrate an enterprise application for automating of the business profess, which is responded by a flow of market environment. There are two categories of method that integrate enterprise applications. One is Synchronous Integration, and the other is Asynchronous Integration. EAI(Enterprise Application Integration) and Web service which of the asynchronous integration is focused in the automating method of the business process. After we construct the application integration for automating of the business process, we have to concern about managing of the business transaction. Many Organizations have proposed the process method of business transaction based on 2-phase commit protocol. But this method can′t supply the phase that classify the transaction by transaction weight. In this paper, we propose an efficient method of transaction process for business transactions, which is composed by ′Classify Phase′ that classify transactions. We called this model "3-Phase Commit Method Applied by Classify Phase", we design this model to manage an resource of enterprise efficiently. The proposed method is compared by the method based on 2-Phase commit that could be a problem of management the resource of enterprise, and the advantage of this method is certified to propose the solution of that problem.

  • PDF

Efficient Method of Processing Long-term Transactions for Distributed Environment (분산 환경에서 장기 트랜잭션의 효율적인 처리 방안)

  • 정지호;엄기환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1498-1508
    • /
    • 2003
  • It is important to integrate an enterprise application for automating of the business process, which is responded by a flow of market environment. There are two categories of method that integrate enterprise applications. One is Synchronous Integration, and the other is Asynchronous Integration. EAI(Enterprise Application Integration) and Web service which of the asynchronous integration is focused in the automating method of the business process. After we construct the application integration for automating of the business process, we have to concern about managing of the business transaction. Many Organizations have proposed the process method of business transaction based on 2-phase commit protocol. But this method can't supply the phase that classify the transaction by transaction weight. In this Paper, we Propose an efficient method of transaction process for business transactions, which is composed by ‘Classify Phase’ that classify transactions. We called this model “3-Phase Commit Method Applied by Classify Phase”, we design this model to manage an resource of enterprise efficiently. The proposed method is compared by the method based on 2-Phase commit that could be a problem of management the resource of enterprise, and the advantage of this method is certified to propose the solution of that problem.

An Efficient Method of Transaction Process for EAI(Enterprise Application Integration) and Web Service (EAI(Enterprise Application Integration)와 Web Service 환경에서 트랜잭션의 효율적인 처리 방안)

  • Jung, Ji-Ho;Yoon, Chung
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.435-442
    • /
    • 2004
  • It is important to integrate an enterprise application for automating of the business process, which is responded by a flow of market environment. There are two categories of method that integrate enterprise applications. One is Synchronous Integration, and the other is Asynchronous Integration. EAI(Enterprise Application Integration) and Web service which of the asynchronous integration is focused in the automating method of the business process. After we construct the application integration for automating of the business process, we have to concern about managing of the business transaction. Many Organizations have proposed the process method of business transaction based on 2-phase commit protocol. But this method can't supply the phase that classify the transaction by transaction weight. In this paper, we propose an efficient method of transaction process for business transactions, which is composed by "Classify Phase" that classify transactions. We called this model "3-Phase Commit Method Applied by Classify Phase, " we design this model to manage an resource of enterprise efficiently. The proposed method is compared by the method based on 2-Phase commit that could be a problem of management the resource of enterprise, and the advantage of this method is certified to propose the solution of that problem.ion of that problem.

A Distributed Real-Time Concurrency Control Scheme using Transaction the Rise of Priority (트랜잭션 우선 순위 상승을 이용한 분산 실시간 병행수행제어 기법)

  • Lee, Jong-Sul;Shin, Jae-Ryong;Cho, Ki-Hyung;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.484-493
    • /
    • 2001
  • As real-time database systems are extended to the distributed computing environment, the need to apply the existing real-time concurrency control schemes to the distributed computing environment has been made. In this paper we propose an efficient concurrency control scheme for distributed real-time database system. Our proposed scheme guarantees a transaction to commit at its maximum, reduces the restart of a transaction that is on the prepared commit phase, and minimizes the time of the lock holding. This is because it raises the priority of the transaction that is on the prepared commit phase in the distributed real-time computing environment. In addition, it reduces the waiting time of a transaction that owns borrowed data and improves the performance of the system, as a result of lending the data that the transaction with the raised priority holds. We compare the proposed scheme with DO2PL_PA(Distributed Optimistic Two-Phase Locking) and MIRROR(Managing Isolation in Replicated Real-time Object Repositories) protocol in terms of the arrival rate of transactions, the size of transactions, the write probability of transactions, and the replication degree of data in a firm-deadline real-time database system based on two-phase commit protocol. It is shown through the performance evaluation that our scheme outperforms the existing schemes.

  • PDF

Designing and Efficient Web Service Transaction Protocol Using 2PC and THP

  • Han, Seung-Kyun;Park, Jong-Hun;Choi, Ki-Seok
    • Proceedings of the CALSEC Conference
    • /
    • 2005.03a
    • /
    • pp.261-266
    • /
    • 2005
  • Web services provide an effective means to carry out coordinated transactions between multiple, independent business parties. While there are several specific protocols currently being discussed to address the coordination of web services-enabled business transactions, we consider the tentative hold protocol (THP) that allows the placement of tentative holds on business resources prior to actual transactions in order to provide increased flexibility in coordination. In this paper, we present a formal coordination framework for applying THP in conjunction with 2PC to the problem in which service providers independently manage resources and clients seek to acquire the resources from multiple providers as a single atomic transaction. The proposed framework facilitates the performance optimization of THP through effective parameterization with the notion of overhold size and hold duration. The simulation results show that the proposed adaptive approach yields a significant improvement over other non-adaptive policies.

  • PDF

Modeling and Analysis of a Reordering-based Optimistic Cache Consistency Protocol (재배열 기반의 낙관적 캐쉬 일관성 유지 기법의 모델링과 분석)

  • Cho, Sung-Ho;Hwang, Jeong-Hyon
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.458-467
    • /
    • 2001
  • Optimistic Two-Phase Locking(O2PL) performs as well as or better than the other approaches because it exploits client caching well and also has relatively lower network bandwidth requirements. However, O2PL leads to unnecessary waits, because, it can not be commit a transaction until the transaction obtains all requested locks. In addition, Optimistic Concurrency Control(OCC) tends to make needless aborts. This paper suggests an efficient optimistic cache consistency protocol that overcomes such shortcomings. Our scheme decides whether to commit or abort a transaction without wait and it adopts transaction re-ordering in order to minimize the abort rate. Our scheme needs only one version for each data item in spite of the re-ordering mechanism used. Finally, this paper presents a simulation-based analysis that shows superiority in performance of out scheme to O2PL and OCC.

  • PDF