Wound-wait scheme-deadlock prevention, Database Management System

"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.

Posted Date: 3/12/2013 3:11:29 AM | Location : United States







Related Discussions:- Wound-wait scheme-deadlock prevention, Assignment Help, Ask Question on Wound-wait scheme-deadlock prevention, Get Answer, Expert's Help, Wound-wait scheme-deadlock prevention Discussions

Write discussion on Wound-wait scheme-deadlock prevention
Your posts are moderated
Related Questions
Explain about primary key Primary Key: It is one of the candidate keys that are taken to be the recognizing key for the entire table. E.g. although there are two candidate ke

List the types of authorization. A) Read authorization B) Write authorization C) Update authorization D) Drop authorization


Sparse and Dense Indexes These indexes in principle are the similar as that of indexes used at the back of the book. The key facts of the indexes are: They are arranged

An instance of relational schema R (A, B, C) has distinct values of A including NULL values. then A is a candidate key or not? If relational schema R (A, B, C) has distinct val

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

Which types of data supported by MySQL for Time and Date formats?  MySQL supports a number of time and date column formats: Some of them are 1) DATE 2) DATETIME 3) TIM

What is a block and a block number? A block is a contiguous sequence of sectors from a single track of one platter. Every request specifies the address on the disk to be refere

Define Specialisation and generalization in brief? Specialisation / generalization: Generalization or Specialization represents the is a relationship set, an necessary element

Define object-relational systems? Systems that give object-oriented extensions to relational systems are known as object-relational systems.