An improved algorithm for finding the median distributively

Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(√logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages.

[1]  Yehuda Afek,et al.  Time and message bounds for election in synchronous and asynchronous complete networks , 1985, PODC '85.

[2]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[3]  Francis Y. L. Chin,et al.  An almost linear time and O(nlogn+e) Messages distributed algorithm for minimum-weight spanning trees , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

[5]  Michael Rodeh,et al.  Distributed k-selection: From a sequential to a distributed algorithm , 1983, PODC '83.

[6]  Greg N. Frederickson,et al.  Tradeoffs for selection in distributed networks (Preliminary Version) , 1983, PODC '83.

[7]  Shmuel Zaks,et al.  Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[8]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[9]  Teresa A. Matsushita.  Distributed Algorithms for Selection , 1983 .

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

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

[12]  Yehuda Afek,et al.  Election and traversal in unidirectional networks , 1984, PODC '84.

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