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 is meant by data-transfer rate, What is meant by data-transfer rate? ...

What is meant by data-transfer rate? The data-transfer rate is the rate at which data can be retrieved from or kept to the disk.

What is called a query -execution engine, What is called a query -execution...

What is called a query -execution engine? The query implementation engine takes a query evaluation plan, implements that plan, and returns the answers to the query.

Unix System Administration, What Command You Use What Day of the week were ...

What Command You Use What Day of the week were you born

What is a candidate key, What is a candidate key? Minimal super keys ar...

What is a candidate key? Minimal super keys are known as candidate keys.

Synonyms, Synonyms It allows short names or alternative names for objects....

Synonyms It allows short names or alternative names for objects. Example :               CREATE SYNONYM D30               FOR EMPD30;   Now if we give command:

Data fragmentation-use of partial data by applications, Use of partial data...

Use of partial data by applications : In common, applications work with views rather than whole relations. Thus, it may be more appropriate to work with subsets of relations rather

What is null described testing for null in sql?, What is NULL? Give an exa...

What is NULL? Give an example to described testing for NULL in SQL? The NULL SQL keyword is used to represent either a missing value or a value which is not applicable in a re

Functional Dependencies, What exactly is the concept of Functional Dependen...

What exactly is the concept of Functional Dependencies? And how do we associate this concept with the logic of Super-keys, Candidate Keys, etc? Given Relation R(A,B,C,D,E) with de

What is a phantom deadlock, What is a Phantom Deadlock? In distributed...

What is a Phantom Deadlock? In distributed deadlock detection, the delay in propagating local information might cause the deadlock detection algorithms to recognize deadlocks

What is the difference between primary key and a unique key, What's the dif...

What's the difference between a primary key and a unique key? Both primary key and unique key enforces uniqueness of the column on which they are explained. But by default prim

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