Issue No. 04 - April (1997 vol. 8)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.588617
<p><b>Abstract</b>—We consider the problem of selecting the <it>K</it>th smallest element of a set distributed among the sites of a communication network when the size of messages is bounded; that is, each message is a packet which contains at most <it>c</it> bits, where <it>c</it>≥ 1 is a constant.</p><p>A general selection algorithm using packets is presented and its packet complexity is analyzed. Its complexity is shown to be a significant improvement for a large range of packet sizes over the existing bounds. The proposed technique is then instanciated for specific classes of network topologies; the resulting bounds either match or improve the ones of existing solutions for a large range of values of the packet size. Furthermore, it is bit optimal in star networks.</p>
Bounded-size messages, communication complexity, communication networks, distributed algorithms, distributed sets, K-selection.
J. Urrutia, N. Santoro and A. Negro, "Efficient Distributed Selection with Bounded Messages," in IEEE Transactions on Parallel & Distributed Systems, vol. 8, no. , pp. 397-401, 1997.