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

Why object-oriented system use the relational dbms, Why, generally does an ...

Why, generally does an object-oriented system use the relational DBMS? The reasons for using relational DBMS for OO systems could be any combination of following: a. Many or

Development of large scale distributed real systems, Question: (a) What...

Question: (a) What are the challenges in the development of Large Scale Distributed Real Systems? (b) What is backward engineering and forward engineering in a design packa

What is a recursive relationship, What is a recursive relationship? Give an...

What is a recursive relationship? Give an example not used in the text. A recursive relationship is a relationship among an entity and itself. For example, given the entity PER

What are the concurrency issues, Concurrency issues Data integrity...

Concurrency issues Data integrity: Threads accessing same object need to be synchronized, such as: banking account. Deadlock: One or more threads in system are perman

What is called as an n-way merge, What is called as an N-way merge? The...

What is called as an N-way merge? The merge operation is a generalization of the two-way merge used by the standard in-memory sort-merge algorithm. It merges N runs, so it is k

Cataloguing, differences between a classified catalog and a dictionary cata...

differences between a classified catalog and a dictionary catalog

State the design of associations, State the Design of Associations Bef...

State the Design of Associations Before designing associations, it is essential to know the way they are used. For this, analysis of association traversals is required. It is

Define one-way associations using pointers, One-way Associations If an...

One-way Associations If an association is only traversed in single direction, then it is known as one-way association. It is implemented as a pointer or an attribute which con

What are the advantages of object oriented databases, What are the advantag...

What are the advantages of object oriented databases in comparison with others? Why it is still not widely used? Object oriented designs are coherent, efficient and less prone

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