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

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

Define average latency time, Define average latency time. The average l...

Define average latency time. The average latency time of the disk is one-half the time for a full rotation of the disk.

Create a new service-based database, In this assignment, you will create a ...

In this assignment, you will create a program that works with multiple tables. In this assignment, you will work with the factory and sales tables. 1. Create a new project nam

Datawarehouse, Define a job scheduling strategy that will meet business req...

Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pictori

Explain the rules for creating a labelled precedence graph, Explain the rul...

Explain the rules for creating a labelled precedence graph for testing view serializability.            Ans: A schedule S is view serializable if it is view equivalent to a ser

To delete a particular column in a relation which command, To delete a part...

To delete a particular column in a relation which command is used ? To delete a particular column in a relation ALTER command is used.

Describe the storage structure of indexed sequential file, Describe the sto...

Describe the storage structure of indexed sequential files and their access method. Ans: Index offers a lookup capability to rapidly reach the vicinity of the desired record.

Parallelism of transaction execution-data fragmentation, Parallelism of tra...

Parallelism of transaction execution: A transaction can be divided into various sub-queries that can operate on fragments in parallel. This enhances the degree of concurrency in t

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