Wound-wait scheme-deadlock prevention, Database Management System

Assignment Help:

"Wound-wait" scheme: It is based on a preemptive method. It is based on a simple rule:

                  If Ti requests a database resource that is held by Tj

                   then if Ti has a larger timestamp (Ti is younger) than that of Tj 

                    it is allowed to wait;

     else Tj is wounded up by Ti.

For example, suppose that 3 transactions T1, T2 and T3 were generated in that series, then if T1requests for a data item which is presently held by transaction T2, then T2 is rolled back and data item is allotted to T1 as T1 has a smaller time stamping than that of T2. Though, if T3 requests for a data item which is presently held by transaction T2, then T3 is permitted to wait.

                                    2389_Wound-wait scheme-deadlock prevention.png

                                                   Figure: Wound-wait Scheme of Deadlock prevention

It is vital to see that whenever any transaction is rolled back, it would not make a starvation condition, i.e., no transaction gets rolled back repeatedly and is never permitted to make progress. Also both "wait-die" & "wound-wait" idea avoid starvation. The number of aborts & rollbacks will be higher in wait-die scheme than in the wound-wait idea. But one main problem with both of these ideas is that these ideas may result in unnecessary rollbacks.


Related Discussions:- Wound-wait scheme-deadlock prevention

State the process of rearranging classes and operations, State the process ...

State the process of Rearranging Classes and Operations The various, yet similar operation of different classes can be slightly modified thus that they can be covered by a sin

Max. no. of structures in a table or structure, What is the max. no. Of str...

What is the max. no. Of structures that can be included in a table or structure. Nine.

What is called a query evaluation plan, What is called a query evaluation p...

What is called a query evaluation plan? A sequence of primitive operations that can be used to assess a query is a query evaluation plan or a query implementation plan.

Want massive amount of products imported through csv, OPENCART - Want Massi...

OPENCART - Want Massive amount of products Imported through CSV We have a massive list of products that would take completely too long to do data entry. We require a slick progr

Intersection, If R1 and R2 are two union compatible relations or functions,...

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Transactions and concurrency management, Transactions And Concurrency Manag...

Transactions And Concurrency Management  Introduction One of the main benefits of storing data in an integrated repository or a database is to permit sharing of it betwee

List the steps for converting state diagram to the code, List the steps for...

List the steps for converting state diagram to the code. a) Finding major control path b) Finding the conditional statements  c) Finding the loops  d) Finding error ro

What is specialization, What is Specialization? Specialization: Special...

What is Specialization? Specialization: Specialization permits you to describe new types of information (new structural types or latest domains of information), although reusin

Relational constraints, Relational and E-R Model There are three types o...

Relational and E-R Model There are three types of constraints on relational database that have: DOMAIN CONSTRAINT PRIMARY KEY CONSTRAINT INTEGRITY CONSTRAINT

Assignment, how does Btree differ from a B+ - tree?

how does Btree differ from a B+ - tree?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd