Research Output

Communicating parallel processes

  By considering the problem of an event timer it is shown that the commonly available synchronizing facilities (monitors, CSP, distributed processes) are not able to always satisfactorily model the requirements of several processes which must run in parallel and which have to communicate with each other. The problem is discussed in general terms which show that what is required are new concepts for communicating processes. The synchronization facilities proposed are augmented to incorporate the concept of process scheduling directly from a process. This ensures that proper scheduling of process components can take place. The new mechanism is then applied to a number of the standard problems. It is also shown that the use of nondeterminacy in current facilities is probably not required and is, in fact, for many applications, a positive disadvantage.

  • Type:

    Article

  • Date:

    31 January 1986

  • Publication Status:

    Published

  • Publisher

    Wiley

  • DOI:

    10.1002/spe.4380160106

  • ISSN:

    0038-0644

  • Library of Congress:

    QA75 Electronic computers. Computer science

  • Dewey Decimal Classification:

    004 Data processing & computer science

  • Funders:

    Historic Funder (pre-Worktribe)

Citation

Kerridge, J., & Simpson, D. (1986). Communicating parallel processes. Software: Practice and Experience, 16(1), 63-86. https://doi.org/10.1002/spe.4380160106

Authors

Keywords

Distributed systems, real parallelism, communicating processes.

Monthly Views:

Available Documents