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

Job scheduling strategy, 1) Define a job scheduling strategy that will meet...

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

What is the use of with clause in sql, What is the use of with clause in SQ...

What is the use of with clause in SQL? The with clause gives a way of defining a temporary view whose explanation is available only to the query in which the with clause occurs

Frequecy count, how to calculate frequency count of algorithm

how to calculate frequency count of algorithm

Give short note on the following terms- dirty pages and etl, Give short not...

Give short note on the following terms:Dirty pages and ETL a.) Dirty pages. These are buffer pages which comprise modifications which haven't been written to disk. b.

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

Explain the fundamental concepts of object-orientation, Explain the Fundame...

Explain the Fundamental concepts of object-orientation Software developers, data base administrators (DBAs) need to be familiar with fundamental concepts of object-orientation.

Develop a database design , A practice called Perfect Pets provides private...

A practice called Perfect Pets provides private health care for domestic pets throughout America. This service is provided through various clinics located in the main cities of Ame

Database design and documentation, A use case diagram giving a pictorial ov...

A use case diagram giving a pictorial overview of user requirements and brief use case descriptions. As the case study contains only an outline of a business scenario, you will als

Table handling, Table Handling  In RDBMS more than one table can be tac...

Table Handling  In RDBMS more than one table can be tackled at a time by using join operation. Join operation is a relational operation that causes 2 tables with a common domai

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