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
Define the five basic operators of relational algebra? Five basic operators of relational algebra are: 1. Union (∪∪∪∪) - Selects tuples which are in either P or Q or in both

Inheritance Adjustment As in object oriented analysis and design terms inheritance defines a relationship between classes, where as one class shares structure or behaviour def

Two-way Associations Mostly, associations are travel in both directions, although not usually with same frequency. There are three approaches for the implementation. In

What is the difference between a key and a superkey? Key - A key a single attribute or a combination of two or more attributes of an entity set which is used to identify one

sql is relationally complete-justify

Find the names of all Albums that have more than 30 tracks. Result: (name: varchar(255))

Which product produces the relation that has attributes of R1 and R2 ? Cartesian product produce the relation which has attributes of R1 and R2

1.  Based on the dependency diagram, create a database whose tables are in at least 2NF, showing the dependency diagram for each table (as shown in class).  Label the types of depe

Define Hash files organization a. Hashing includes computing the address of a data item by calculating a function on the search key value.   b. A hash function h is a functi

Which database level is closest to the users? External database level is closest to the users.