Prove that cautious waiting avoids deadlock.
What will be an ideal response?
In cautious waiting, a transaction Ti can wait on a transaction Tj (and hence Ti
becomes blocked) only if Tj is not blocked at that time, say time b(Ti), when Ti waits.
Later, at some time b(Tj) > b(Ti), Tj can be blocked and wait on another transaction Tk
only if Tk is not blocked at that time. However, Tj cannot be blocked by waiting on an
already blocked transaction since this is not allowed by the protocol. Hence, the wait-for
graph among the blocked transactions in this system will follow the blocking times and
will never have a cycle, and so deadlock cannot occur.
You might also like to view...
The ScreenTip appears when a visitor to the Web page ____.
A. clicks the link B. points to and right-clicks the link C. passes the mouse pointer over the link D. all of the above
The result of =LEFT("Dallas, Texas", 9 ) is ________
A) as, Texas B) las,Texas C) Dallas, T D) Dallas,Te
How can you erase a part of the stroke of a path?
What will be an ideal response?
In MySQL Administrator, you can use the ____ section to manage user privileges.
A. Server Connections B. Server Information C. Catalogs D. User Administration