A distributed algorithm to implement n-party rendezvous

  • Rajive Bagrodia
Session 3 Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 287)


The concept of n-party rendezvous has been proposed to implement synchronous communication among an arbitrary number of concurrent, asynchronous processes. The problem of implementing n-party rendezvous captures two central issues in the design of distributed systems: exclusion and synchronization. This paper describes a simple, distributed algorithm, referred to as the event manager algorithm, to implement n-party rendezvous. It also compares the performance of this algorithm with an existing algorithm for this problem.


Event Manager Process Configuration Committee Coordination Conflicting Event Synchronous Communication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ada 82]
    Reference Manual for the Ada Programming Language United States Department Of Defense, 1982.Google Scholar
  2. [Back 84]
    Back, R. and Kurki-Suonio, R. Cooperation in Distributed Systems Using Symmetric Multi-Process Handshaking. Technical Report No. Ser. A, No. 34, Department of Information Processing Mathematics, Swedish University of Abo, Finland, 1984.Google Scholar
  3. [Bagrodia 86]
    Bagrodia, R. A Distributed Algorithm To Implement The Generalized Alternative Command of CSP. In Proccedings of 6th International Conference on Distributed Systems. Cambridge, May, 1986.Google Scholar
  4. [Bagrodia 87a]
    Bagrodia, R. An Environment For the Design and Performance Analysis of Distributed Systems. PhD thesis, Dept. of Computer Sciences, University of Texas, Austin, Tx 78712., May, 1987.Google Scholar
  5. [Bagrodia 87b]
    Bagrodia, R., Chandy, K.M., and Misra, J. A Message-Based Approach To Discrete-Event Simulation. IEEE Transactions on Software Engineering, June, 1987.Google Scholar
  6. [Bernstein 80]
    Bernstein, A.J. Output guards And Non-determinism in Communicating Sequential Processes. ACM TOPLAS 2(2):234–238, April, 1980.CrossRefGoogle Scholar
  7. [Buckley 83]
    Buckley, G. and Silberschatz, A. An Effective Implementation Of The Generalized Input-Output Construct of CSP. ACM TOPLAS 5(2):223–235, April, 1983.CrossRefGoogle Scholar
  8. [Chandy 87]
    Chandy, K.M. and Misra, J. Synchronizing Asynchronous Processes: The Committee Coordination Problem. Technical Report, Dept. of Computer Sciences, University of Texas, Austin, Tx 78712., 1987. In Preparation.Google Scholar
  9. [Charlesworth 87]
    A. Charlesworth. The Multiway Rendezvous. ACM Trans. on Programming Languages and Systems 9(3):350–366, 1987.CrossRefGoogle Scholar
  10. [Forman 87]
    Forman, I.R. On the Design of Large Distributed Systems. Technical Report No. STP-098-86, Microelectronics and Computer Technology Corp, Austin, Texas, January, 1987. Preliminary version in Proc. First Int'l Conf. on Computer Languages, Miami, Florida, October 25–27, 1986.Google Scholar
  11. [Francez 86]
    Francez, N., Hailpern, B. and Taubenfeld, G. Script:A Communication Abstraction Mechanism. Science of Computer Programming 6(1), January, 1986.Google Scholar
  12. [Hoare 78]
    Hoare, C.A.R. Communicating Sequential Processes. CACM 21(8):666–677, August, 1978.Google Scholar
  13. [Milne 85]
    Milne, George. CIRCAL and the Representation Of Communication, Concurrency and Time. ACM TOPLAS 7(2), April, 1985.Google Scholar
  14. [Natarajan 86]
    Natarajan, N. A Distributed Synchronization Scheme for Communicating Processes. The Computer Journal 29(2):109–117, 1986.CrossRefGoogle Scholar
  15. [Schneider 82]
    Schneider, F. Synchronization In Distributed Programs. ACM TOPLAS 4(2):125–148, April, 1982.CrossRefGoogle Scholar
  16. [Van De Snepscheut 81]
    Van De Snepscheut, J.L.A. Synchronous Communication Between Asynchronous Components. IPL 13(3):127–130, December, 1981.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Rajive Bagrodia
    • 1
  1. 1.Computer Science DepartmentUniversity of California at Los AngelesLos Angeles

Personalised recommendations