This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Multiparty Interactions for Interprocess Communication and Synchronization
November 1989 (vol. 15 no. 11)
pp. 1417-1426

The authors consider the essential properties of a multiparty interaction construct which serves as a primitive for interprocess communication and synchronization in distributed programs. It is claimed that more general constructs, which violate the suggested properties, are appropriate for abstraction but should not be seen as a communication primitive, and that both facilities are needed. Several acceptability criteria are posed for multiparty interactions, and various possibilities for constructs satisfying these criteria are presented. These include introducing a novel kind of nondeterminism within the assignments of an interaction, weakening the synchronization among the participants in an interaction, and varying the number of participants in order to provide a high-level treatment of fault tolerance.

[1] American National Standard Inst. Inc.,Ada Programming Language, ANSI/MIL-STD-1815, 1983.
[2] K. Apt, N. Francez, and S. Katz, "Appraising fairness in languages for distributed programming,"Distributed Comput., vol. 2, no. 4, pp. 226-241, 1988.
[3] P. C. Attie, N. Francez, and O. Grumberg, "Fairness and hyperfairness in multiparty interactions," submitted for publication: preliminary version as MCC Tech. Rep. STP-356-87, Aug. 1987.
[4] P. C. Attie,Raddle87 Reference Manual, MCC Tech. Rep. STP-340- 87, Austin, TX, Jan. 1988.
[5] R. J. R. Back and R. Kurki-Suonio, "Decentralization of process nets with a centralized control,"Distributed Computing, vol. 3, pp. 73-87, 1989. An earlier version appears inProc. 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pp. 131-142, 1983.
[6] R. J. R. Back and R. Kurki-Suonio, "Distributed cooperation with Action Systems,"ACM Trans. Programming Languages Syst., vol. 10, no. 4, pp. 513-554, Oct. 1988.
[7] K. P. Birman and T. A. Joseph, "Exploiting virtual synchrony in distributed systems," inProc. ACM Symp. Operat. Syst. Prin., 1987, pp. 123-138.
[8] A. Charlesworth, "The multi-way rendezvous,"ACM Trans. Programming Languages Syst., vol. 9, no. 2, pp. 350-366, July 1987.
[9] D. R. Cheriton and S. E. Deering, "Host groups: A multicast extension doe datagram internetworks," inProc. 9th Data Communication Symp., Whistler Mountain, B.C., Canada; inACM SIGCOM, vol. 15, no. 4, Sept. 1985.
[10] P. J. Courtois, F. Heymans, and D. L. Parnas, "Concurrent control with readers and writers,"Commun. ACM, vol. 14, no. 2, pp. 667- 668, Oct. 1971.
[11] E. W. Dijkstra,A Discipline of Programming. Englewood Cliffs, NJ: Prentice-Hall, 1976.
[12] T. Elrad and N. Francez, "Decomposition of distributed programs into communication-closed layers,"Sci. Comput. Program., vol. 2, pp. 155-173, Dec. 1982.
[13] I. R. Forman, "On the design of large distributed systems," MCC Tech. Rep. STP-098-86 (rey. 1.0), Austin, TX, Jan. 1987; preliminary version inProc. 1st Int. Conf. Computer Languages, Miami, FL, Oct. 1986.
[14] I. R. Forman, "The lift problem revisited," MCC Tech. Rep., STP- 269-87, Austin, TX, 1987.
[15] I. R. Forman and M. Evangelist, "An EFT system: A case study in design using Raddle," MCC Tech. Rep. STP-121-87, Austin, TX, Apr. 1987.
[16] N. Francez,Fairness. New York: Springer-Verlag, 1986.
[17] N. Francez, "Cooperating proofs for distributed programs with multiparty interactions," 1988, submitted for publication.
[18] N. Francez, B. Hailpern, and G. Taubenfeld, "Script: A communication abstraction mechanism and its verification,"Sci. Comput. Programming, vol. 6, pp. 35-88, 1986.
[19] A. J. Frank, L. D. Wittie, and A. J. Bernstein, "Multicast communication on network computers,"IEEE Software, pp. 49-61, May 1985.
[20] N. Gehani, "Broadcasting sequential processes (BSP),"IEEE Trans. Software Eng., vol. SE-10, no. 4, pp. 343-351, July 1984.
[21] C. A. R. Hoare, "Communicating sequential processes,"Commun. ACM, vol. 21, pp. 666-677, 1978.
[22] S. Katz and D. Peled, "An interleaving set temporal logic," inProc. 6th Ann. ACM Symp. on Principles of Distributed Comput., 1987, pp. 178-190.
[23] S. Ramesh and S. L. Mehndiratta, "A methodology for developing distributed programs,"IEEE Trans. Software Eng., vol. SE-13, no. 8, pp. 967-976, 1987.
[24] D. W. Wall,Mechanisms for Broadcast and Selective Broadcast. Ph.D. dissertation, Stanford Univ., Stanford, CA, June 1980.

Index Terms:
interprocess communication; synchronization; multiparty interaction construct; primitive; distributed programs; acceptability criteria; nondeterminism; weakening; participants; fault tolerance; fault tolerant computing; parallel programming
Citation:
M. Evangelist, N. Francez, S. Katz, "Multiparty Interactions for Interprocess Communication and Synchronization," IEEE Transactions on Software Engineering, vol. 15, no. 11, pp. 1417-1426, Nov. 1989, doi:10.1109/32.41333
Usage of this product signifies your acceptance of the Terms of Use.