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

What do you mean by atomicity and aggregation, What do you mean by atomicit...

What do you mean by atomicity and aggregation? Atomicity : Either all actions are carried out or none are. Users should not have to worry about the effect of incomplete trans

ER-diagram, The State of NewYork certifies firefighters throughout state an...

The State of NewYork certifies firefighters throughout state and keep track all of them, as well as of the state’s fire departments. Each fire department has unique department numb

Answer, Describe multi key files

Describe multi key files

Explain the deferred update, Explain the Deferred Update The deferred ...

Explain the Deferred Update The deferred update methods do not physically update the database on disk till after a transaction reaches its commit point; after that the updates

Can you delete data element, Can we delete data element, which is being use...

Can we delete data element, which is being used by table fields. No we cant delete data element.

Benefits and drawbacks of heap files, Benefits of heap files 1.   This i...

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

Define the terms key attribute and value set, Define the terms i) Key attr...

Define the terms i) Key attribute ii) Value set Key attribute: An entity type usually has an attribute whose values are exact from each individual entity in the collection. Su

Access data using logical database, If one requires to access data using...

If one requires to access data using Logical Database , the use of events is unavoidable. Yes, if someone wants to access data using Logical database then the use of events

Explain the weak entity set, Explain the Weak Entity Set An Entity set...

Explain the Weak Entity Set An Entity set which does not have sufficient attribute to make a primay key is known as weak entity set. For instance, dependents of an employee in

What is system r, What is System R? What are its two major subsystems? ...

What is System R? What are its two major subsystems? System R was intended and developed over a period of 1974-79 at IBM San Jose Research Center. It is a prototype and its pur

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