𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Analysis of a distributed algorithm for extrema finding in a ring

✍ Scribed by D. Rotem; E. Korach; N. Santoro

Book ID
108016261
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
976 KB
Volume
4
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finding the Extrema of a Distributed Mul
Finding the Extrema of a Distributed Multiset
✍ Paola Alimonti; Paola Flocchini; Nicola Santoro πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 327 KB

If the ring is asynchronous, the number of messages required to solve LE (and, thus, EF) is ⌰(n и log n) [4, 6-8, 14, 15]. For synchronous rings, several solutions have been presented with different bits-time complexities [5, 8-11, 16, 18, 19]. Unlike the asynchronous case, knowledge of the ring siz