Distributed algorithm for extrema-finding in circular configuration of processors (Q1083214)
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: Distributed algorithm for extrema-finding in circular configuration of processors |
scientific article; zbMATH DE number 3976362
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distributed algorithm for extrema-finding in circular configuration of processors |
scientific article; zbMATH DE number 3976362 |
Statements
Distributed algorithm for extrema-finding in circular configuration of processors (English)
0 references
1985
0 references
A distributed algorithm for finding the leader (highest numbered node) of a circular configuration of n processors is presented. Bounds on the number of message transmissions are derived. The average number of messages transmitted is of O(n ln n).
0 references
leader
0 references
number of message transmissions
0 references
average number of messages transmitted
0 references
0 references
0 references
0.8709041
0 references
0.86823654
0 references
0.86690485
0 references
0.8593949
0 references
0.85893637
0 references
