0ch16-by gyb(冲突时的文件备份2015-06-03 13_07_54).pptVIP

Deadlock prevention (Cont.) Timeout-Based Schemes : a transaction waits for a lock only for a specified amount of time. After that, the wait times out and the transaction is rolled back. thus deadlocks are not possible simple to implement; but starvation is possible. Also difficult to determine good value of the timeout interval. Deadlock Detection（死锁检测） Deadlocks can be described as a wait-for graph等待图, which consists of a pair G = (V,E), V is a set of vertices (all the transactions in the system) E is a set of edges; each element is an ordered pair Ti ?Tj. Deadlock Detection (Cont.) Wait-for graph without a cycle Wait-for graph with a cycle Deadlock Recovery When deadlock is detected : Some transaction will have to rolled back Rollback -- determine how far to roll back transaction Total rollback only as far as necessary Include the number of rollbacks in the cost factor to avoid starvation Other Approaches to Concurrency Control Timestamp-Based Protocols Each transaction is issued a timestamp when it enters the system. the protocol maintains for each data Q two timestamp values: W-timestamp(Q) is the largest time-stamp of any transaction that executed write(Q) successfully. R-timestamp(Q) is the largest time-stamp of any transaction that executed read(Q) successfully. Timestamp-Based Protocols The protocol manages concurrent execution such that the time-stamps determine the serializability order. The timestamp ordering protocol ensures that any conflicting read and write operations are executed in timestamp order. Timestamp-Based Protocols (Cont.) Suppose a transaction Ti issues a read(Q) If TS(Ti) ? W-timestamp(Q), then Ti needs to read a value of Q that was already overwritten. Hence, the read operation is rejected, and Ti is rolled back. If TS(Ti)? W-timestamp(Q), then the read operation is executed, and R-timestamp(Q) is set to max(R-timestamp(Q), TS(Ti)). Timestamp-Based Protocols (Cont.) Suppose that transaction Ti issues write(Q). If TS(Ti) R-time