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

EER models, Ask question #MinimThe Georgia Tech Library (GTL) has approxima...

Ask question #MinimThe Georgia Tech Library (GTL) has approximately 16,000 members, 100,000 titles, and 250,000 volumes (an average of 2.5 copies per book). About 10 percent of the

What is relational algebra, What is Relational Algebra? Relational algebr...

What is Relational Algebra? Relational algebra is a Procedural query Language?

Er-diagram, courier company er-diagram

courier company er-diagram

Define the canonical cover, Define the Canonical cover Ans: A canonical...

Define the Canonical cover Ans: A canonical cover F c for F is a set of dependencies like F logically implies all dependencies in F c , and F c logically entails all dependen

Queries, Find the names of all Albums that have more than 30 tracks. Result...

Find the names of all Albums that have more than 30 tracks. Result: (name: varchar(255))

Define query optimization, Define query optimization. Query optimizatio...

Define query optimization. Query optimization refers to the process of search the lowest -cost method of evaluating a given query.

Having clause-data manipulation language, Having clause This clause...

Having clause This clause is used for producing conditions on grouped information. Example: Find maximum salary and department number of those departments where maxim

File Management Principles, What are the requirements to ensure the objecti...

What are the requirements to ensure the objectives of file management principle is realized?

Components of database manager, Components of database manager The ab...

Components of database manager The above functions are reached by the database manager. The major elements of a database manager are: Authorisation control: This mod

Explain cnt in the respects of qbe, Explain CNT in the respects of QBE ? ...

Explain CNT in the respects of QBE ? CNT: It is one of the aggregation commands given in QBE. It is used to identify number of tuples

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