Thumbnail
Access Restriction
Subscribed

Author Locher, Thomas ♦ Wattenhofer, Roger ♦ Kuhn, Fabian
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each node holds a numeric element, the goal of a k-selection algorithm is to determine the $k^{th}$ smallest of these elements. We prove that distributed selection indeed requires more work than other aggregation functions such as, e.g., the computation of the average or the maximum of all elements. On the other hand, we show that the $k^{th}$ smallest element can be computed efficiently by providing both a randomized and a deterministic k-selection algorithm, dispelling the misconception that solving distributed selection through in-network aggregation is infeasible.
Description Affiliation: ETH Zurich, Switzerland (Locher, Thomas; Wattenhofer, Roger) || Institute of Theoretical Computer Science, ETH Zurich, Switzerland (Kuhn, Fabian)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 51
Issue Number 9
Page Count 7
Starting Page 93
Ending Page 99


Open content in new tab

   Open content in new tab
Source: ACM Digital Library