Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Paper
Lower Bounds for Distributed Maximum-Finding Algorithms
Abstract
Tills paper establishes several lower bounds of the form Ω(nlogn) for the number of messages needed to find the maximum label in a circular configuration of n labeled processes with no central controller. © 1984, ACM. All rights reserved.
Related
Hong-linh Truong, Maja Vukovic, et al.
ICDH 2024
Miao Guo, Yong Tao Pei, et al.
WCITS 2011
Amy Lin, Sujit Roy, et al.
AGU 2024