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

Write the motivations led to development of oo-dbms, Write the motivations ...

Write the motivations led to development of OO-DBMS? 1.  Programmer frustration with RDBMSs. 2.  Requirement for special features.

Define a relation in dbms, Define a relation ? Relation - A relations...

Define a relation ? Relation - A relations is a named two-dimensional table of data. Mathematically, a relation can be described as a subset of the cartesian product of a lis

Calculate the record size r in bytes, An employee record has the following ...

An employee record has the following structure struct employee { int eno; char name[22]; float salary; char dept[10];}; (i) Calculate the record size R in bytes.

Explain the shadow paging recovery technique, Explain the shadow paging rec...

Explain the shadow paging recovery technique.  Ans: Shadow paging is a method used to acquire atomic and durable transactions, and provides the capability to manipulate pages i

List the data structures implemented by the storage manager, List the data ...

List the data structures implemented by the storage manager. The storage manager executes the following data structure a) Data files b) Data dictionary c) indices

Atomicity-transaction , Atomicity: It describes a transaction to be a one ...

Atomicity: It describes a transaction to be a one unit of processing. We can also say either a transaction will be finished completely or not at all. In the transaction example 1

ER DIAGRAM, draw ER diagram of student entity and course entity where attri...

draw ER diagram of student entity and course entity where attribute of student entity are student roll, student name, student phone and student address and attribute of course enti

What is odbc and what is its function, Question: (a) What is ODBC and w...

Question: (a) What is ODBC and what is its function? (b) What is Web application server, and how does it work from a database perspective? (c) What does e-commerce mean

Create student database and retrieve course taught by king, Create student ...

Create student database and retrieve course name taught by king? STUDENT (name, student#, class, major) COURSE (course name, course#, credit hours, department) SECTION (secti

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