This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Generalized Message-Passing Mechanism for Communicating Sequential Processes
June 1988 (vol. 37 no. 6)
pp. 646-651
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 synch

[1] G. R. Andrews, "The distributed programming language SR-mechanisms, design, and implementation,"Software Practice Exper., vol. 12, pp. 719-754, Aug. 1982.
[2] G. R. Andrews and F. B. Schneider, "Concepts and notations for concurrent programming,"ACM Comput. Surveys, vol. 15, no. 1, pp. 3-43, Mar. 1983.
[3] J. de Bakker,Mathematical Theory of Program Correctness. London, England: Prentice-Hall, 1980.
[4] E. W. Dijkstra, "Guarded commands, nondeterminacy and formal derivation of programs,"Commun. ACM, vol. 18, no. 8, pp. 453- 457, 1975.
[5] E. W. Dijkstra, "Invariance and non-determinacy," Int. Summer School in Concept Distributed Programming, Munich, Germany, 1984.
[6] T. Elrad and N. Francez, "A weakest precondition semantics for communicating processes,"Theoret. Comput. Sci., vol. 29, pp. 231- 250, 1984.
[7] J. A. Feldman, "High level programming for distributed computing,"Commun. ACM, vol. 22, pp. 353-368, June 1979.
[8] C. A. R. Hoare, "Communicating sequential processes,"Commun. ACM, vol. 21, pp. 666-677, 1978.
[9] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[10] P. C. Treleaven, D. R. Brownbridge, and R. P. Hopkins, "Data-driven and demand-driven computer architecture,"ACM Comput. Surveys, vol. 14, pp. 93-143, Mar. 1982.
[11] U.S. Department of Defense, "Programming language Ada: Reference manual," vol. 106,Lecture Notes in Computer Science. New York: Springer-Verlag, New York, 1981.
[12] INMOS,Occam Programming Language. Englewood Cliffs, NJ: Prentice-Hall, 1984.

Index Terms:
bidirectional message passing; generalized message-passing mechanism; communicating sequential processes; symmetric communication mechanism; concurrent processes; tree structure; systolic arrays; synchronization; communication primitives; CSP-like syntax; weakest-precondition semantics; systolic arrays; distributed processing; parallel processing; trees (mathematics).
Citation:
P.M. Lenders, "A Generalized Message-Passing Mechanism for Communicating Sequential Processes," IEEE Transactions on Computers, vol. 37, no. 6, pp. 646-651, June 1988, doi:10.1109/12.2203
Usage of this product signifies your acceptance of the Terms of Use.