Jump to content

Locks with ordered sharing

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by HatemAMahmoud (talk | contribs) at 16:01, 4 March 2024. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In databases and transaction processing the term Locks with ordered sharing comprises several variants of the two-phase locking (2PL) concurrency control protocol generated by changing the blocking semantics of locks upon conflicts. One variant is identical to strict commitment ordering (SCO). Further softening of locks eliminates thrashing.

See also

Autonomic computing

References

D. Agrawal, A. El Abbadi, A. E. Lang: The Performance of Protocols Based on Locks with Ordered Sharing, IEEE Transactions on Knowledge and Data Engineering, Volume 6, Issue 5, October 1994, pp. 805–818, ISSN 1041-4347

Mahmoud, H. A., Arora, V., Nawab, F., Agrawal, D., & El Abbadi, A. (2014). Maat: Effective and scalable coordination of distributed transactions in the cloud. Proceedings of the VLDB Endowment, 7(5), 329-340.

This database-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Locks_with_ordered_sharing&oldid=1211811216"

Hidden category:

All stub articles