No label defined (Q3768384)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4026811
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4026811 |
Statements
1987
0 references
synchronous communication
0 references
asynchronous processes
0 references
distributed systems
0 references
exclusion
0 references
synchronization
0 references
0.7315945625305176
0 references
0.7197427153587341
0 references
0.7029739618301392
0 references
0.6918298602104187
0 references
[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.
0 references