Exact average message complexity values for distributed election on bidirectional rings of processors (Q910221)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:910221 |
scientific article; zbMATH DE number 4139294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact average message complexity values for distributed election on bidirectional rings of processors |
scientific article; zbMATH DE number 4139294 |
Statements
Exact average message complexity values for distributed election on bidirectional rings of processors (English)
0 references
1990
0 references
distributed system
0 references
distributed election algorithm
0 references
leader finding
0 references
0 references
0 references
0.8905428051948547
0 references
0.8520787954330444
0 references
0.8292248249053955
0 references
0.82253497838974
0 references
0.8187547922134399
0 references
