Skip to main content
SpringerLink
Log in

Concurrent access to data

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

Problems caused by concurrent access to data can be solved by locking. This, however, diminishes efficiency and may cause deadlocks among the accessing processes. In this paper the structuring of data sets is deduced from assertions about accesses which may be performed simultaneously. This structuring supports the development of operations which synchronize concurrent access to these data. Thus the provisions for locking are transferred from programs to data structures where the requests for locking actually arise. The synchronization operations will exclude all undesired interferences and will maximize the number of possible simultaneous accesses in accordance with the original assertions.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bernstein, A.J., Shoshani, A.: Synchronization in a parallel-accessed data base. Comm. ACM 11, 604–607 (1969)

    Google Scholar 

  2. Berztiss, A.T.: Data structures: theory and practice. New York-London: Academic Press 1973

    Google Scholar 

  3. Chamberlin, D.D., Boyce, R.F., Traiger, I.L.: A deadlock-free scheme for resource locking in a data-base environment. Proc IFIP Congress 1974, Preprints, pp. 340–343, 1974

  4. Denning, P.: Third generation computer systems. Comput. Surveys 3, 175–216 (1971)

    Article  MATH  Google Scholar 

  5. Dijkstra, E. W.: Cooperating sequential processes. Programming Languages, pp. 43–112. London: Academic Press 1968

    Google Scholar 

  6. Easton, W. B.: Process synchronization without longterm interlock. Third Symposium on Operating Systems Principles, Palo Alto, pp. 95–100, 1971

  7. Nehmer, J.: Dispatcher-Elementarfunktionen für symmetrische Mehrprozessor-DV-Systeme. Dissertation, Kernforschungszentrum Karlsruhe, KFK 1866, 1973

  8. Parnas, D.L.: On a solution to the cigarette smoker's problem (without conditional statements). Comm. ACM 18, 181–183 (1975)

    Google Scholar 

  9. Patil, S.S.: Limitations and capabilities of Dijkstra's semaphore primitives for coordination among processes, Proj. MAC, Computation Structures Group Memo 57. Cambridge (Mass.): MIT 1971

    Google Scholar 

  10. Ramsperger, N.: Verringerung von Prozeßbehinderungen in Rechensystemen. Technische Universität München, Dissertation, 1974

Download references

Author information

Authors and Affiliations

  1. Leibniz-Rechenzentrum der Bayerischen Akademie der Wissenschaften, Barer Str. 21, D-8000, München 2, Germany (Fed. Rep.)

    N. Ramsperger

Authors
  1. N. Ramsperger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ramsperger, N. Concurrent access to data. Acta Informatica 8, 325–334 (1977). https://doi.org/10.1007/BF00271341

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00271341

Keywords

Search

Navigation