Summary
edit| Description |
Read-write conflict: SCO Vs. SS2PL. Duration of transaction T2 is longer with SS2PL than with SCO. SS2PL delays write operation w2[x] of T2 until T1 commits, due to a lock on x by T1 following read operation r1[x]. If t time units are needed for transaction T2 after starting write operation w2[x] in order to reach ready state, than T2 commits t time units after T1 commits. However, SCO does not block w2[x], and T2 can commit immediately after T1 commits. | |||
|---|---|---|---|---|
| Source |
Yoav Raz (1991): Locking Based Strict Commitment Ordering, or How to improve Concurrency in Locking Based Resource Managers, DEC-TR 844, December 1991. Yoav Raz (1995): The Principle of Commitment Ordering in yoavraz.googlepages.com | |||
| Date |
1991 | |||
| Author |
Yoav Raz | |||
| Permission (Reusing this file) |
https://sites.google.com/site/yoavraz2/home/wikipedia-copyright-permission
|
Licensing
editFile history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 05:24, 5 January 2009 | 1,124 × 804 (39 KB) | Comps (talk | contribs) | read-write conflict. SCO Vs. SS2PL. Duration of T2 is longer for SS2PL. From: Yoav Raz: "The Principle of Commitment Ordering" |
You cannot overwrite this file.
File usage
The following page uses this file: