Question: Consider the timestamp-ordering protocol, and two transactions, one that writes two data items p and q, and another that reads the same two data items.
Consider the timestamp-ordering protocol, and two transactions, one that writes two data items p and q, and another that reads the same two data items. Give a schedule whereby the timestamp test for a write operation fails and causes the first transaction to be restarted, in turn causing a cascading abort of the other transaction. Show how this could result in starvation of both transactions.(Such a situation, where two or more processes carry out actions, but are unable to complete their task because of interaction with the other processes, is called a live lock.
Step by Step Solution
3.38 Rating (160 Votes )
There are 3 Steps involved in it
Consider a timestampordering protocol and two transactions that each ... View full answer
Get step-by-step solutions from verified subject matter experts
