20.5. Time-stamp ordering (TSO)
We are aiming to run transactions concurrently and to produce a serializable execution of their operations. An alternative approach to locking for achieving this is to associate a time-stamp with each transaction. One serializable order is then imposed on the operations: that of the time-stamps of the transactions they comprise. Assume initially that the time-stamp is the time of the start of the transaction and is recorded at the invoked object with every operation that transaction invokes. We have already assumed that an object is able to record such information.
Recall from Section 19.6.2 that for serializability of two transactions it is necessary and sufficient for the order of their invocations of all non-commutative ...
Get Operating Systems: Concurrent and Distributed Software Design now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
