Speculation to Increase the Concurrency of Nested Transactions

نویسندگان

  • P. Krishna Reddy
  • Masaru Kitsuregawa
چکیده

We have proposed an improved concurrency control protocol for nested transactions based on speculation. In the proposed speculative nested locking (SNL) protocol, whenever a sub-transaction finishes work with a data object (produces after-image), it's parent inherits the lock. The waiting sub-transaction carries out speculative executions by accessing both beforeand after-images of preceding sub-transaction. It then selects appropriate execution after the termination of preceding sub-transactions. In this way, by carrying out multiple executions for a transaction, SNL increases concurrency. The SNL approach requires both extra processing power and main memory to support speculative executions. In this paper, we have presented the SNL approach and explained how it increases both intraand inter-transaction concurrency by trading extra resources as compared to Moss's nested locking protocol.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Speculation Based Nested Locking Protocol to Increase the Concurrency of Nested Transactions

In this paper, we have proposed improved concurrency control protocol based on speculation for nested transuctions and explained how it increases both intraand intertransaction concurrency as compared to Mo.s.s's nested locking protocol. I n the proposed speculative nested locking (SNL) protocol, whenever a sub-trunsuctinn finishes work with a data object (produces after-image), it's purent inh...

متن کامل

Optimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems

In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...

متن کامل

Concurrency control of nested cooperative transactions in active DBMS

Active database management systems(ADBMS) uses Event-Condition-Action rules (ECA rules). Each ECA rule speciies what action to be taken when an event occurs and the speciied condition is satissed. In this paper, we introduce a concurrency control scheme for handling nested cooperative transactions using detached mode ECA rules of an ADBMS. A state transition model has been proposed to specify d...

متن کامل

Concurrency Control Protocol for Nested Transactions in Real-Time Databases

In this paper we consider real-time concurrency control for the nested transaction model. We analyze problems that have pure optimistic and pessimistic approaches. As the solution we propose a hybrid concurrency control algorithm which acts as an optimistic for transactions from different transaction trees and as pessimistic inside a single transaction tree.

متن کامل

A concurrency control protocol for nested transactions

Nested transactions[6, 5] provide fine grain atomicity, efficient recovery control, and structural modularity. In distributed environments, they provide a natural and semantically clean way of modelin g computations . However, the characteristics of nested transactions are sufficiently different from those o f traditional single-level transactions that concurrency control for nested transaction...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008