Wound-wait scheme-deadlock prevention, Database Management System

"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.

Posted Date: 3/12/2013 3:11:29 AM | Location : United States







Related Discussions:- Wound-wait scheme-deadlock prevention, Assignment Help, Ask Question on Wound-wait scheme-deadlock prevention, Get Answer, Expert's Help, Wound-wait scheme-deadlock prevention Discussions

Write discussion on Wound-wait scheme-deadlock prevention
Your posts are moderated
Related Questions
1. Item based services will be charged fixed prices, and time-based will be charged variably depending on time. Such as per hour. Item-based: Fixed, pedicure, waxing, threading, fa

Modify a sequence: ALTER SEQUENCE SEQSS INCREMENT 2 MAXVALUE 3000;   Removing a sequence: DROP SEQUENCE SEQSS;

Describe the shadow paging technique.

What are the properties in a relation ? In a relation Ordering of rows is immaterial and No two rows are identical.

Special comparison operator used in where Clause a.   between. ...and...It gives range among two values (inclusive) Example: SELECT ENAME, SAL FROM EMP WHERE SAL BETWE

What is called an evaluation primitive? A relational algebra operation annotated with instructions on how to evaluate is known as an evaluation primitive.

Find out the names of all employees who work for first Bank Corporation from database. SELECT EMPLOYEE_NAME FROM WORKS WHERE COMPANYNAME = ‘First Bank Corporation';

Multilevel Index The Multilevel Index is a modification of the secondary level index system. In this system we might be use even more number of levels in case the table is eve

Explain what is RDBMS ? RDBMS - RDBMS is a database management system (DBMS) which stores data within the form of relations. Relational databases are powerful since they need f

A Relation Schema represented by R(A1, A2, ..., An) is made up of the relation name the list of attributes and R Ai that it contains. A relation is described as a set of tuples