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

Oracle, I have 10+ yrs exp in oracle Sql ,Pl/SQl,Forms ,Reports. I am exper...

I have 10+ yrs exp in oracle Sql ,Pl/SQl,Forms ,Reports. I am expert in assignements & Online tutoring so i want to join you. Please guide me. Thanks Brajesh Shukla +91 9899641535

Abap/4 program, It is not possible to make an ABAP/4 program, which having ...

It is not possible to make an ABAP/4 program, which having only Subroutines. False. We can make ABAP/4 program, which having only Subroutines.

Explain b-tree, What is B-Tree? A B-tree eliminates the redundant stora...

What is B-Tree? A B-tree eliminates the redundant storage of search-key values .It permits search key values to appear only once.

RDBMS, Benefits and limitations

Benefits and limitations

Explain interblock gap, Explain Interblock gap? Interblock Gap - A trac...

Explain Interblock gap? Interblock Gap - A track of a disk is separated into equal-sized disk blocks. Blocks are separated through fixed-size gaps, called as interblock gaps th

ERD, entity relationship diagram about finance

entity relationship diagram about finance

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