• DocumentCode
    915017
  • Title

    A generalized message-passing mechanism for communicating sequential processes

  • Author

    Lenders, Patrick M.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
  • Volume
    37
  • Issue
    6
  • fYear
    1988
  • fDate
    6/1/1988 12:00:00 AM
  • Firstpage
    646
  • Lastpage
    651
  • Abstract
    Bidirectional message-passing (bi-io), a novel symmetric communication mechanism for concurrent processes, is introduced and developed. The mechanism is symmetric in the sense that, in one atomic action, a message is transmitted in each direction between two processes. For some applications (tree structure, systolic arrays) this method is shown to have several advantages over conventional synchronization and communication primitives (mainly conciseness of programs, absence of certain types of deadlock). The mechanism is rigorously defined with a CSP-like syntax and a weakest-precondition semantics. Two systolic arrays are developed using bidirectional message-passing: a matrix-vector multiplier and a palindrome recognizer
  • Keywords
    distributed processing; parallel processing; trees (mathematics); CSP-like syntax; bidirectional message passing; communicating sequential processes; communication primitives; concurrent processes; generalized message-passing mechanism; symmetric communication mechanism; synchronization; systolic arrays; tree structure; weakest-precondition semantics; Communication networks; Concurrent computing; Distributed computing; Distributed processing; Helium; Message passing; Strontium; System recovery; Systolic arrays; Tree data structures;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.2203
  • Filename
    2203