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

Consistency-transaction , Consistency: This property makes sure that a com...

Consistency: This property makes sure that a complete transaction implementation takes a database from one consistent state to another consistent state. If the transaction fails e

Domain constraints, Domain Constraints Domain constraints are primarily...

Domain Constraints Domain constraints are primarily formed for defining the logically correct values for an attribute of a relation. The relation allows attributes of a relatio

Database recovery and security, Database Recovery And Security Introdu...

Database Recovery And Security Introduction In this part we will introduce two main issues relating to database management systems. A computer system suffers from dissi

Concurrency control, Give the two reasons for allowing concurrency

Give the two reasons for allowing concurrency

Example of ancestry database , Ancestry database records information about ...

Ancestry database records information about family trees . Following information is recorded about each person: FIRSTNAME first name SURNAME surname MNAME maiden name (if

Two types of blocks in the fixed -length representation, What are the two t...

What are the two types of blocks in the fixed -length representation? Define them. Anchor block: Have the first record of a chain. Overflow block: Have the records other tha

Oracle/sql, can you create a database for me in oracle/sql

can you create a database for me in oracle/sql

Design a query plan for distributed query, (a) Design a query plan for the ...

(a) Design a query plan for the following distributed query: An application at site B wants to compute a join of STUDENT ? Id=StudId TRANSCRIPT where STUDENT (Id,Major) is at site

What is the use of keyword isa, What is the use of keyword ISA? The use...

What is the use of keyword ISA? The use of keyword ISA is to show that a class is a specialization of another class.

What is the use of union and intersection operation, What is the use of Uni...

What is the use of Union and intersection operation? Union: The result of this operation contains all tuples that are either in r1 or in r2 or in both r1 and r2.Duplicate tuple

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