skip to main content
article
Free Access

An optimal algorithm for mutual exclusion in computer networks

Published:01 January 1981Publication History
First page image

References

  1. 1 Courtois, P.J., Heymans, F., and Parnas, D.L. Concurrent control with "readers" and "writers." Comm. ACM 14, 10 (Oct. 1971), 667- 668. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2 deBruijn, N.G. Additional comments on a problem in concurrent programming and control. Comm. ACM 10, 3 (March 1967), 137- 138. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta lnformatica 1, 2 (1971), 115-138.Google ScholarGoogle Scholar
  4. 4 Dijkstra, E.W. Solution of a problem in concurrent programming control Comm. ACM 8, 9 (Sept. 1965), 569. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Dijkstra, E.W. The structure of the THE multiprogramming system. Comm. ACM 11, 5 (May 1968), 341-346. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Eisenberg, M.A., and McGuire, M.R. Further comments on Dijkstra's concurrent programming control problem. Comm. A CM 15, 11 (Nov. 1972), 999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Hill, J. Carver. Synchronizing processors with memory-contentsgenerated interrupts. Comm. ACM 16, 6 (June 1973), 350-351. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Knuth, D.E. Additional comments on a problem in concurrent programming control. Comm. ACM 9, 5 (May 1966), 321-322. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9 Lamport, U A new solution of Dijkstra's concurrent programming problem. Comm. ACM 17, 8 (Aug. 1974), 453-455. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10 Lamport, U Time, clocks and the ordering of events in a distributed system. Comm. A CM 21, 7 (July 1978), 558-565. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11 Lamport, L. Time, clocks and the ordering of events in a distributed system. Rep. CA-7603-2911, Mass. Comptr. Assoc., Wakefield, Mass. March 1976.Google ScholarGoogle Scholar
  12. 12 Ricart, G., and Agrawala, A.K. Performance of a distributed network mutual exclusion algorithm. Tech. Rept. TR-774, Dept. Comptr. Sci., Univ. of Maryland, College Park, Md., March 1979.Google ScholarGoogle Scholar
  13. 13 Ricart, G., and Agrawala, A.K. Using exact timing to implement mutual exclusion in a distributed network. Tech. Rept. TR-742, Dept. Comptr. Sci., Univ. of Maryland, College Park, Md. March 1979.Google ScholarGoogle Scholar

Index Terms

  1. An optimal algorithm for mutual exclusion in computer networks

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image Communications of the ACM
      Communications of the ACM  Volume 24, Issue 1
      Jan. 1981
      35 pages
      ISSN:0001-0782
      EISSN:1557-7317
      DOI:10.1145/358527
      Issue’s Table of Contents

      Copyright © 1981 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 January 1981

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader