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

Explain the two types of participation constraint., Explain the two types o...

Explain the two types of participation constraint. 1. Total: The participation of an entity set E in a relationship set R is said to be total if each entity in E participates i

ER diagram, #question. acompani datdbase needs to store information about e...

#question. acompani datdbase needs to store information about employees (identified by a social security number,with salary and phone as attributes) and departments (identified by

Give the reasons for allowing concurrency, Give the reasons for allowing co...

Give the reasons for allowing concurrency? The reasons for allowing concurrency is if the transactions run serially, a short transaction might have to wait for a preceding long

Prepare an erd for the scenario, Question: (a) Prepare an ERD for the s...

Question: (a) Prepare an ERD for the scenario given below. (b) Convert the ER diagram produced in (a) above into its physical design. You have to choose an appropriate Pri

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.

Example on relational database schema, Question: The following relation...

Question: The following relational database schema corresponds to a part of a database used by the Registry Department of a university. DEPARTMENT (d#, d-name, head-of-dept)

In which relational modes cardinality is termed, In which relational modes,...

In which relational modes, cardinality is termed? Answer : Cardinality is termed in a number of tuples relational modes.

Data warehouse, 1) Define a job scheduling strategy that will meet business...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

A b-tree of order how much children m has maximum, A B-tree of order how mu...

A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

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