Skip to main content

A Dependency, Commitment and Recovery Model for Atomic Actions

  • Chapter

Part of the book series: Texts and Monographs in Computer Science ((MCS))

Abstract

Some ideas on the construction of user applications as atomic actions are developed. Atomic actions that last a long time pose several problems if conventional ideas on concurrency control and recovery are applied. What is required is some means of delaying commitment without sacrificing performance. A model is proposed in which it is possible for an action to release and process as yet uncommitable objects. The impact of this on recovery is also discussed.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. B. Lomet, “Process Structuring, Synchronisation and Recovery Using Atomic Actions”, ACM SIGPLAN Notices, Vol. 12, No. 3, March, 1977, pp. 128–137. [Also Chap. 4]

    Article  Google Scholar 

  2. M. Hammer and D. Shipman, “The Reliability Mechanisms of SDD-1 : A System for Distributed Databases”, ACM TODS, Vol. 13, No. 2 December 1980, pp. 431–466.

    Article  Google Scholar 

  3. B. Lampson and H. Sturgis, “Atomic Transactions”, Lecture Notes in Computer Science, Vol. 105, Springer Verlag, 1981, pp. 246–265.

    Google Scholar 

  4. J. N. Gray, “Notes on Data Base Operating Systems”, Lecture Notes in Computer Science, Vol. 60, Springer Verlag, 1978, pp. 398–481.

    Google Scholar 

  5. S. K. Shrivastava, “Structuring Distributed Systems for Recoverability and Crash Resistance”, IEEE Trans. on Software Engineering, SE-7, No. 4, July 1981, pp. 436–447. [Also Chap. 5]

    Article  MathSciNet  Google Scholar 

  6. W. H. Köhler, “A Survey of Techniques for Synchronization and Recovery in Decentralised Computer Systems”, ACM Computing Surveys, Vol. 13, June 1981, pp. 149–183.

    Article  Google Scholar 

  7. K. Eswaran et al, “On the Notions of Consistency and Predicate Locks in a Data Base System”, CACM, Vol. 19, Nov. 1976, pp. 624–633.

    MATH  MathSciNet  Google Scholar 

  8. B. Randell, P. A. Lee and P. C. Treleaven, “Reliability Issues in Computing System Design”, ACM Computing Surveys, Vol. 10, June 1978, pp. 123–165.

    Article  MATH  Google Scholar 

  9. L. A. Bjork, “Recovery Scenario for a DB/DC System” Proc. of ACM Nat. Conf., 1973, pp. 142–146.

    Google Scholar 

  10. C. T. Davies, “A Recovery/Integrity Architecture for a Data System”, Technical Report, IBM San Jose, TR02.528, May 1972.

    Google Scholar 

  11. C. T. Davies, “Recovery Semantics for a DB/DC System”, Proc. ACM Nat. Conf., 1973, pp. 136–141.

    Google Scholar 

  12. C. T. Davies, “Data Processing Spheres of Control”, IBM Systems Journal, Vol. 17, No. 2, 1978, pp. 179–198.

    Article  Google Scholar 

  13. C. T. Davies, “Data Processing Integrity”, Computing Systems Reliability, Cambridge Univ. Press, 1979, pp. 288–354.

    Google Scholar 

  14. I. Grief, “Notes on the Design of a Calendar System”, Proc. Computer Networking Symposium, Dec. 1980, pp. 185–192.

    Google Scholar 

  15. P. M. Merlin and B. Randell, “State Restoration in Distributed Systems”, Proc. of 8th Int. Symp. Fault-Tolerant Computing, June 1978, pp. 129–134. [Also Chap. 6]

    Google Scholar 

  16. W. G. Wood, “A Decentralised Recovery Control Protocol”, Proc. 11th Int. Symp. Fault-Tolerant Computing, June 1981, pp. 159–164. [Also Chap. 6]

    Google Scholar 

  17. J. N. Gray, “The Transaction Concept: Virtues and Limitations”, Proc. 7th Very Large Data Base Conf., Sept. 1981, pp. 144–154.

    Google Scholar 

  18. L. A. Bjork, “Generalized Audit Trail Requirements and Concepts for Database Applications”, IBM Syst. Jr. No. 3, 1975, pp. 229–245.

    Google Scholar 

  19. A. J. Herbert and R. M. Needham, “Sequencing Computation Steps in a Network”, ACM OP. SYS. Review, Vol. 15, December 1981, pp. 59–63.

    Article  Google Scholar 

  20. C. A. Ellis and G. J. Nutt, “Office Information Systems and Computer Science”, ACM Computing Surveys, Vol. 12, March 1980, pp. 27–60.

    Article  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Shrivastava, S.K. (1985). A Dependency, Commitment and Recovery Model for Atomic Actions. In: Shrivastava, S.K. (eds) Reliable Computer Systems. Texts and Monographs in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82470-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82470-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82472-2

  • Online ISBN: 978-3-642-82470-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics