Abstract
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.
The research was initiated while the author was with the Microelectronics & Computer Technology Corporation, Austin. It was partially supported by a grant from the IBM Corporation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Reference Manual for the Ada Programming Language United States Department Of Defense, 1982.
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.
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.
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.
Bagrodia, R., Chandy, K.M., and Misra, J. A Message-Based Approach To Discrete-Event Simulation. IEEE Transactions on Software Engineering, June, 1987.
Bernstein, A.J. Output guards And Non-determinism in Communicating Sequential Processes. ACM TOPLAS 2(2):234–238, April, 1980.
Buckley, G. and Silberschatz, A. An Effective Implementation Of The Generalized Input-Output Construct of CSP. ACM TOPLAS 5(2):223–235, April, 1983.
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.
A. Charlesworth. The Multiway Rendezvous. ACM Trans. on Programming Languages and Systems 9(3):350–366, 1987.
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.
Francez, N., Hailpern, B. and Taubenfeld, G. Script:A Communication Abstraction Mechanism. Science of Computer Programming 6(1), January, 1986.
Hoare, C.A.R. Communicating Sequential Processes. CACM 21(8):666–677, August, 1978.
Milne, George. CIRCAL and the Representation Of Communication, Concurrency and Time. ACM TOPLAS 7(2), April, 1985.
Natarajan, N. A Distributed Synchronization Scheme for Communicating Processes. The Computer Journal 29(2):109–117, 1986.
Schneider, F. Synchronization In Distributed Programs. ACM TOPLAS 4(2):125–148, April, 1982.
Van De Snepscheut, J.L.A. Synchronous Communication Between Asynchronous Components. IPL 13(3):127–130, December, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagrodia, R. (1987). A distributed algorithm to implement n-party rendezvous. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1987. Lecture Notes in Computer Science, vol 287. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18625-5_48
Download citation
DOI: https://doi.org/10.1007/3-540-18625-5_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18625-0
Online ISBN: 978-3-540-48033-4
eBook Packages: Springer Book Archive