scientific article; zbMATH DE number 4026811

From MaRDI portal
Publication:3768384





[For the entire collection see Zbl 0625.00019.] 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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768384)