Answers are grounded in this paper and cite their sources.
An algorithm for selecting the kth smallest element of a distributed file using shout‐echo communication primitives is presented. It is shown that, for large values of k (e. g., the median), the proposed algorithm improves the existing upperbound.
No takes yet. Share an insight, caveat, or question.
Rotem et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: