A theory of atomic transactions

  • Nancy Lynch
  • Michael Merritt
  • William Weihl
  • Alan Fekete
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 326)

Abstract

This paper describes some results of a recent project to develop a theory for reasoning about atomic transactions. This theory allows careful statement of the correctness conditions to be satisfied by transaction-processing algorithms, as well as clear and concise description of such algorithms. It also serves as a framework for rigorous correctness proofs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8 References

  1. [AFLMW]
    Aspnes, J., Fekete, A., Lynch, N., Merritt, M., and Weihl, W., "A Theory of Timestamp-Based Concurrency Control for Nested Transactions," Proceedings of 14th International Conference on Very Large Data Bases, to appear.Google Scholar
  2. [BBG]
    Beeri, C., Bernstein, P. A., and Goodman, N., "A Model for Concurrency in Nested Transaction Systems," Technical Report, Wang Institute TR-86-03, March 1986.Google Scholar
  3. [BHG]
    Bernstein, P., Hadzilacos, V., and Goodman, N., "Concurrency Control and Recovery in Database Systems," Addison-Wesley, 1987.Google Scholar
  4. [Davies]
    Davies, C. T., "Recovery Semantics for a DB/DC Systems," Proceedings of 28th ACM National Conference, 1973, pp. 136–141.Google Scholar
  5. [FLMW1]
    Fekete, A., Lynch, N., Merritt, M., and Weihl, W., "Nested Transactions and Read/Write Locking," Proceedings of 6th ACM Symposium on Principles of Database Systems, 1987, pp. 97–111. An expanded version is available as Technical Memo MIT/LCS/TM-324, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., April 1987.Google Scholar
  6. [FLMW2]
    Fekete, A., Lynch, N., Merritt, M., and Weihl, W., "Nested Transactions, Conflict-Based Locking and Dynamic Atomicity," Technical Memo MIT/LCS/TM-340, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., September 1987. Submitted for publication.Google Scholar
  7. [Gifford]
    Gifford, D., "Weighted Voting for Replicated Data," Proceedings of 7th ACM Symosium on Operating System Principles, 1979, pp. 150–162.Google Scholar
  8. [GL]
    Goldman, K., and Lynch, N., "Nested Transactions and Quorum Consensus," Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987, pp. 27–41. An expanded version is available as Technical Report MIT/LCS/TR-390, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., May 1987.Google Scholar
  9. [Herlihy]
    Herlihy, M., "Extending Multiversion Time-Stamping Protocols to Exploit Type Information," IEEE Transactions on Computers C-36, April 1987.Google Scholar
  10. [HLMW]
    Herlihy, M., Lynch, N., Merritt, M., and Weihl, W., "On the Correctness of Orphan Elimination Algorithms," Proceedings of 17th IEEE Symposium on Fault-Tolerant Computing, 1987, pp. 8–13.Google Scholar
  11. [Hoare]
    Hoare, C. A. R., "Communicating Sequential Processes," Prentice Hall International, 1985.Google Scholar
  12. [Liskov]
    Liskov, B., "Distributed Computing in Argus," Communications of ACM, vol. 31, no. 3, March 1988, pp. 300–312.Google Scholar
  13. [LM]
    Lynch, N., and Merritt, M., "Introduction to the Theory of Nested Transactions," Technical Report MIT/LCS/TR-367, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., July 1986. To appear in Theoretical Computer Science.Google Scholar
  14. [LMWF]
    Lynch, N., Merritt, M., Weihl, W., and Fekete, A., "Atomic Transactions," in preparation.Google Scholar
  15. [L T]
    Lynch, N., and Tuttle, M., "Hierarchical Correctness Proofs for Distributed Algorithms," Proceedings of 6th ACM Symposium on Principles of Distributed Computation, 1987, pp. 137–151. An expanded version is available as Technical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., April 1987.Google Scholar
  16. [Milner]
    Milner, R., "A Calculus of Communicating Systems," Lecture Notes in Computer Science 92, Springer Verlag, 1980.Google Scholar
  17. [Moss]
    Moss, J. E. B., "Nested Transactions: An Approach To Reliable Distributed Computing," Ph.D. Thesis, Technical Report MIT/LCS/TR-260, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., April 1981. Also, published by MIT Press, March 1985.Google Scholar
  18. [Perl]
    Perl, S., "Distributed Commit Protocols for Nested Atomic Actions," M.S. Thesis, M.I.T. September 1987.Google Scholar
  19. [SS]
    Spector, A., and Swedlow, K. (eds), "Guide to the Camelot Distributed Transaction Facility: Release 1," Carnegie Mellon University, Pittsburgh, PA., October 1987.Google Scholar
  20. [Reed]
    Reed, D. P., "Naming and Synchronization in a Decentralized Computer System," Ph.D Thesis, Technical Report MIT/LCS/TR-205, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., September 1978.Google Scholar
  21. [Weihl]
    Weihl, W., "Specification and Implementation of Atomic Data Types," Ph.D. Thesis, Technical Report MIT/LCS/TR-314, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA., March 1984.Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Nancy Lynch
    • 1
  • Michael Merritt
    • 2
  • William Weihl
    • 3
  • Alan Fekete
    • 4
  1. 1.M.I.T.USA
  2. 2.AT&T Bell LabsUSA
  3. 3.M.I.T.USA
  4. 4.M.I.T.USA

Personalised recommendations