skip to main content
article
Free Access

Synchronization of communicating processes

Published:01 March 1972Publication History
Skip Abstract Section

Abstract

Formalization of a well-defined synchronization mechanism can be used to prove that concurrently running processes of a system communicate correctly. This is demonstrated for a system consisting of many sending processes which deposit messages in a buffer and many receiving processes which remove messages from that buffer. The formal description of the synchronization mechanism makes it very easy to prove that the buffer will neither overflow nor underflow, that senders and receivers will never operate on the same message frame in the buffer nor will they run into a deadlock.

References

  1. 1 Dijkstra, E.W. Cooperating sequential processes. In Programming Languages, F. Genuys, Ed., Academic Press, New York, 1968, pp. 43-112.Google ScholarGoogle Scholar
  2. 2 Dijkstra, E.W. The structure of the "THE"-- multiprogramming system. Comm. ACM 11, 5 (May 1968), 341-346. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3 Parnas, D.L Information distribution aspects of design methodology. Report, Dep. Computer Sci., Carnegie-Mellon U., Pittsburgh, Pa., Feb. 1971.Google ScholarGoogle Scholar
  4. 4 Saltzer, J.H. Traffic control in a multiplexed computer system (Th.). Rep. MAC-TR-30, Proj. MAC, MIT, Cambridge, Mass., 1966. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5 Botourno, C., et al. Process management and resource sharing in the multiaccess system "ESOPE." Comm. ACM 13, 12 (Dec. 1970), 727-733. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6 Spier, M.J., and Organick, E.I. The multics interprocess communication facility. Proc. Second Symp. on Oper. Syst. Princ., ACM, New York, 1971, pp. 83-91. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7 Dijkstra, E.W. Solution of a problem in concurrent programming control. Comm. ACM 8, 9 (Sept. 1965), 569. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8 Habermann, A.N. An operating system modeled as a set of interacting processes. Ann. Princeton Conf. on Computer Sci. and Syst., March 1971.Google ScholarGoogle Scholar

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 15, Issue 3
    March 1972
    69 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/361268
    Issue’s Table of Contents

    Copyright © 1972 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 March 1972

    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