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

xml, basic structure of xm

basic structure of xml

Differences between a file processing system and a dbms, List any two signi...

List any two significant differences between a file processing system and a DBMS. File Processing System vs. DBMS Data Independence - Data independence is the capacity t

Explain about sql server 2000, What is the difference between SQL Server 2...

What is the difference between SQL Server 2000 complete and differential backups? A complete backup makes a copy of the whole database. A differential backup creates a copy of

Write short notes on domain relational calculus, Write short notes on domai...

Write short notes on domain relational calculus   The domain relational calculus uses domain variables that take on values from an attribute domain rather than values for whole

Define atomicity and aggregation, Atomicity : Either all functions are lai...

Atomicity : Either all functions are laid out or none are. Users could not have to think about the effect of incomplete operations. DBMS ensures this by undoing the functions

How relational calculus is different from relational algebra, How Relationa...

How Relational Calculus is different from Relational Algebra? What do understand by TRC queries and DRC queries?  Ans: Relational calculus contain two calculi, the tuple relati

Define entity integrity and referential integrity, Define entity integrity ...

Define entity integrity and referential integrity.  How does SQL allow specification of  these? Ans: Entity Integrity Rule- If the attribute A of relation R is a prime attribut

Explain the uses of deadlock, Explain the uses of deadlock It will lea...

Explain the uses of deadlock It will lead to deadlock since this is the only place where incoming acknowledgements are processed. Without this code, sender will keep timing ou

Information Technology, What benefits can a company gain by managing its ow...

What benefits can a company gain by managing its own information infrastructure and servicea

What is a primary index, What is a primary index? A primary index is an...

What is a primary index? A primary index is an index whose search key also explains the sequential order of the file.

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