Wait-die scheme -deadlock prevention, Database Management System

Wait-die" scheme: The idea is based on non-preventive method. It is based on a simple rule:

                                If Ti requests a database resource that is held by Tj

                                then if Ti has a smaller timestamp than that of Tj

                                 it is permitted to wait;

                else Ti aborts.

A timestamp may loosely be described as the system generated sequence number that is unique for every transaction. Therefore, a smaller timestamp means an older transaction. 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, it is permitted to wait as it has a smaller time stamping than that of T1. Though, if T3 requests for a data item which is presently held by transaction T2, then T3 is rolled back (die).

                                       1541_Wait-die scheme -Deadlock prevention.png

                                                            Figure: Wait-die Scheme of Deadlock prevention

Posted Date: 3/12/2013 3:10:06 AM | Location : United States







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

Write discussion on Wait-die scheme -deadlock prevention
Your posts are moderated
Related Questions
Question: (a) Define the term e-Government and briefly explain, using appropriate examples, the aspects it covers. (b) Give four reasons as to why a country should adopt e

Explain Thomas' Write rule.  Show how it is different from timestamp ordering protol Ans: In timestamp-based concurrency control the thomas Write rule is a rule. Given a Timest

Explain Authorization and Integrity Manager ? Authorization and Integrity Manager: Tests for the satisfaction of integrity constraints and checks the authority of users to acce

Explain Deadlock detection and recovery Deadlock Detection - A deadlock is said to take place when there is a circular chain of transaction, every waiting for the release of a

why shadow copy technique is used?

#quesDefine 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 pi

What are the two distinct aspects to the implementation of associations? i) It is required to define data declarations which will enable details of actual links to be stored. I

what do you understand by enhanced entity-relationship

Super keys of a relation can have extra attributes. Candidate keys are minimal super key, i.e. such a key have no extraneous attribute. An attribute is known as extraneous if even

Define the term Domain. For each n every attribute there is a set of permitted values known as the domain of that attribute.