operating system《操作系》ch06-process synchronization-63.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Timestamp-ordering Protocol Suppose Ti executes write(Q) If TS(Ti) R-timestamp(Q), value Q produced by Ti was needed previously and Ti assumed it would never be produced Write operation rejected, Ti rolled back If TS(Ti) W-tiimestamp(Q), Ti attempting to write obsolete value of Q Write operation rejected and Ti rolled back Otherwise, write executed Any rolled back transaction Ti is assigned new timestamp and restarted Algorithm ensures conflict serializability and freedom from deadlock Schedule Possible Under Timestamp Pro