Publication
Journal of the ACM
Paper

Lower Bounds for Distributed Maximum-Finding Algorithms

Download paper

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.

Date

20 Sep 1984

Publication

Journal of the ACM

Authors

Topics

Resources

Share