Skip to main content
SpringerLink
Log in

Commutativity-Based Locking for Nested Transactions

  • Conference paper
Persistent Object Systems

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 37 Accesses

Abstract

We introduce a new algorithm for concurrency control in nested transaction systems. The algorithm uses semantic information about an object (commutativity of operations) to obtain more concurrency than is available with Moss’ locking algorithm which is currently used as the default in systems like Argus and Camelot. We define “dynamic atomicity”, a local property of an object, and prove that dynamic atomicity of each object guarantees the correctness of the whole system. Objects implemented using the commutativity-based locking algorithm are dynamic atomic.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Aspnes, A. Fekete, N. Lynch, M. Merritt, and W. Weihl. A theory of timestamp-based concurrency control for nested transactions. In Proceedings of 14th International Conference on Very Large Data Bases, pages 431–444, August 1988.

    Google Scholar 

  2. A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Nested transactions and read/write locking. In 6th ACM Symposium on Principles of Database Systems, pages 97–111, San Diego, CA, March 1987. Expanded version available as Technical Memo MIT/LCS/TM-324, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, April 1987.

    Google Scholar 

  3. A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Commutativity-based locking for nested transactions. Technical Memo MIT/LCS/TM-370, Massachusetts Institute Technology, Laboratory for Computer Science, August 1988. A revised version will appear in JCSS.

    Google Scholar 

  4. K. Goldman and N. Lynch. Nested transactions and quorum consensus. In Proceedings of 6th ACM Symposium on Principles of Distributed Computation, pages 27–41, August 1987. Expanded version is available as Technical Report MIT/LCS/TM-390, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, May 1987.

    Google Scholar 

  5. M. Herlihy, N. Lynch, M. Merritt, and W. Weihl. On the correctness of orphan elimination algorithms. In Proceedings of 17th IEEE Symposium on Fault-Tolerant Computing, pages 8–13, 1987. Also, MIT/LCS/TM-329, MIT Laboratory for Computer Science, Cambridge, MA, May 1987. To appear in Journal of the ACM.

    Google Scholar 

  6. B. Liskov. Distributed computing in argus. Communications of ACM, 31(3):300–312, March 1988.

    Article  MathSciNet  Google Scholar 

  7. N. Lynch, M. Merritt, W. Weihl, and A. Fekete. A theory of atomic transactions. In International Conference on Database Theory, pages 41–71, Bruges, Belgium, September 1988. LNCS 326, Springer Verlag.

    Google Scholar 

  8. N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of 6th ACM Symposium on Principles of Distributed Computation, pages 137–151, August 1987. Expanded version available as Technical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA., April 1987.

    Google Scholar 

  9. J.E.B. Moss. Nested Transactions: An Approach to Reliable Distributed Computing. PhD thesis, Massachusetts Institute Technology, 1981. Technical Report MIT/LCS/TR-260, Laboratory for Computer Science, Massachusetts Institute Technology, April 1981. Also, published by MIT Press, March 1985.

    Google Scholar 

  10. A. Spector and K. Swedlow. Guide to the camelot distributed transaction facility: Release 1, October 1987. Available from Carnegie Mellon University, Pittsburgh, PA.

    Google Scholar 

  11. W.E. Weihl. Specification and Implementation of Atomic Data Types. PhD thesis, Massachusetts Institute Technology, 1984. Technical Report MIT/LCS/TR-314, Laboratory for Computer Science, Massachusetts Institute Technology, Cambridge, MA, March 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Sydney, Australia

    Alan Fekete

  2. Massachusetts Institute of Technology, USA

    Nancy Lynch

  3. AT&T Bell Laboratories, USA

    Michael Merritt

  4. Massachusetts Institute of Technology, USA

    William Weihl

Authors
  1. Alan Fekete
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nancy Lynch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michael Merritt
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. William Weihl
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1990 British Computer Society

About this paper

Cite this paper

Fekete, A., Lynch, N., Merritt, M., Weihl, W. (1990). Commutativity-Based Locking for Nested Transactions. In: Persistent Object Systems. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3173-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3173-1_22

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19626-6

  • Online ISBN: 978-1-4471-3173-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation