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

Structure of the ldb, Though all the ABAP/4 Dictionary Structures that exis...

Though all the ABAP/4 Dictionary Structures that exists in the structure of the LDB, being described in Database Program, we are explaining the Dictionary Structures in the Report.

Types of indexes, Types Of Indexes One of the words used during the fil...

Types Of Indexes One of the words used during the file organisation is the term index. In this part, let us describe this term in more detail. We find the index of keywords

Example of sequences, Example : Create a sequence named SEQSS that starts a...

Example : Create a sequence named SEQSS that starts at 105, has a step of 1 and can take maximum value as 2000.  CREATE SEQUENCE SEQSS START WITH 105 INCREMENT BY 1 MAX VA

Need website hacking security test, We want have a website; we need to test...

We want have a website; we need to test the security of our website. You need to: -Try to bypass our security by simulate a website hacking -Try some hack Techniques like

The users who use easy-to-use menu are called, The users who use easy-to-us...

The users who use easy-to-use menu are called ? The users who use easy to use menu are called as Naïve users.

Management information system, Explain the challenges before an E-business ...

Explain the challenges before an E-business management.

Describe the terms ‘database'' and ‘data warehouse'', Problem: ‘Users a...

Problem: ‘Users and Information system specialists need to spend inordinate amounts of time locating and gathering data' (Watson and Hal, 1998) Recent developments in the ar

Online examination system project, entity relationship diagram for online e...

entity relationship diagram for online examination system

Describe hashing in dbms, Describe Hashing in DBMS? Hashing: Hashing ...

Describe Hashing in DBMS? Hashing: Hashing is a technique to store data within an array so which storing, searching, inserting and deleting data is fast (in theory it's O(1))

Define two-phase locking protocol, Define two-phase locking protocol. A...

Define two-phase locking protocol. Ans: Two-phase locking is significance in the context of ensuring that schedules are serializable. The two-phase locking protocol defines a p

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