Tradeoffs for selection in distributed networks (Preliminary Version)

Algorithms are presented for selecting an element of given rank from a set of elements distributed among the nodes of a network. Network topologies considered are a ring, a mesh, and a complete binary tree. For the ring and the mesh, upper bound tradeoffs are identified between the number of messages transmitted and the total delay due to message transmission. For the tree, an algorithm is presented that uses an asymptotically optimal number of messages.

[1]  Michael Rodeh,et al.  Finding the Median Distributively , 1982, J. Comput. Syst. Sci..

[2]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[3]  Nicola Santoro,et al.  Order statistics on distributed sets , 1982 .

[4]  Danny Dolev,et al.  An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle , 1982, J. Algorithms.

[5]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[6]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..