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

Datawarehouse, Explain four causes for failures in data warehouse projects

Explain four causes for failures in data warehouse projects

Explain growing phase of locking, Explain Growing Phase of locking Grow...

Explain Growing Phase of locking Growing Phase: In this phase the transaction can only obtain locks, but cannot release any lock. The transaction enters the growing phase as so

What is an index, What is an Index? An index is a small table having on...

What is an Index? An index is a small table having only two columns. The first column has a copy of the primary or candidate key of a table and the second column having a set o

What is recursive closure and operation relational algebra, What is recursi...

What is recursive closure? Why is it not possible to describe this operation in relational algebra? Recursive closure is applied to recursive relationship. An instance of rec

Explain the data access protocol, (a) Explain the three types of potentia...

(a) Explain the three types of potential mistake which could occur if concurrency control is not properly enforced in the database system. Support your answer with appropriate ex

Evaluate the null hypothesis, 1.Suppose you are given a dataset that consis...

1.Suppose you are given a dataset that consists of a random sample of tasters, on which the following variables were obtained: (y) Zpref = taste preference for green beans store

Working and processing files, 1.  Define each of the following IN YOUR OWN ...

1.  Define each of the following IN YOUR OWN WORDS: (a)   File: (b)   Record: (c)   Field: (d)   Primary Key: (e)   Secondary Key: 2.  A travel agency wants t

Explain weak and strong entity sets, Explain weak and strong entity sets? ...

Explain weak and strong entity sets? Weak and Strong entity sets: A physically powerful entity set has a primary key. All tuples in the group are distinguishable through that k

Read-set(t) and timestamps-optimistic concurrency contents, read-set(T) : E...

read-set(T) : Each data items that are read by a transaction T Timestamps : for all transaction T, the start-time and the end time are reserved for all the three phases.

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