Strict timestamp ordering
(a) Apply the basic timestamp ordering (BTO) algorithm to schedules S1 and S2. Determine whether or not the algorithmallows the execution of the schedules, and discuss cascading rollback (if any).Hints: each operation takes one time unit, and timestamp of each transaction is the time associated to its first operation.For example, timestamps of transactions T1, T2, […]
Strict timestamp ordering Read More »