论文信息 - A Distributed Algorithm to Implement N-Party Rendevouz

A Distributed Algorithm to Implement N-Party Rendevouz

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.

Rajive L. Bagrodia

[1] George J. Milne,et al. CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

[2] Nissim Francez,et al. Script: A communication abstraction mechanism , 1983, PODC '83.

[3] Abraham Silberschatz,et al. An Effective Implementation for the Generalized Input-Output Construct of CSP , 1983, TOPL.

[4] Arthur Charlesworth,et al. The multiway rendezvous , 1987, TOPL.

[5] N. Natarajan. A Distributed Synchronisation Scheme for Communicating Processes , 1986, Comput. J..

[6] K. Mani Chandy,et al. A Message-Based Approach to Discrete-Event Simulation , 1987, IEEE Transactions on Software Engineering.

[7] Arthur J. Bernstein,et al. Output Guards and Nondeterminism in “Communicating Sequential Processes” , 1980, TOPL.

[8] Jan L. A. van de Snepscheut,et al. Synchronous Communication Between Asynchronous Components , 1981, Inf. Process. Lett..

[9] Fred B. Schneider,et al. Synchronization in Distributed Programs , 1982, TOPL.

[10] Rajive L. Bagrodia. A Distributed Algorithm to Implement the Generalized Alternative Command of CSP , 1986, ICDCS.

[11] R. L. Bagrodia. An environment for the design and performance analysis of distributed systems , 1987 .

[12] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.