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

Which method is used to key transformation, Which method is used to key tra...

Which method is used to key transformation ? A hash method is used to key transformation.

Update operations in dbms - insert operation, Update Operations and Dealing...

Update Operations and Dealing with Constraint Violations There are three basic operations to be executes on relations: Insertion Deletion Update The INSER

View of data, how to submit answers softcopy

how to submit answers softcopy

Join relation of two tuples, Consider the join of a relation R with relatio...

Consider the join of a relation R with relation S. If R has m tuples and S has n tuples, then the maximum size of join is: If R has m tuples and S has n tuples then maximum siz

Why like predicate used for, Why Like predicate used for? LIKE predicat...

Why Like predicate used for? LIKE predicate: The LIKE predicate searches for strings in which have a certain pattern.

Computer, 1. Will you advise that your organization uses open source softwa...

1. Will you advise that your organization uses open source software and why? 2. Why is it important for business managers to have a basic understanding of the software development

Physical records, Physical Records These are the records that are store...

Physical Records These are the records that are stored in the secondary storage devices. For the database relation, physical records are the group of fields kept in adjacent me

Create a customer database and apply queries, For the question given below,...

For the question given below, you are required to submit design and implementation documentation as described over the page. Design, implement (in Java), test and document a set of

Define about the stored procedure, Define about the Stored Procedure - ...

Define about the Stored Procedure - It's a set of T-SQL statements combined together to perform a single task formed by combining numerous small tasks. - When you essentiall

Anomalies, define anomalies and different types of anomalies with example

define anomalies and different types of anomalies with example

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