Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Y. Afek and E. Gafni, Time and message bounds for election in synchronous and asynchronous complete networks,Proceedings of the Fourth ACM Symposium on Principles of Distributed Computing, 1985, pp. 186–185.
B. Awerbuch, Complexity of network synchronization,J. Assoc. Comput. Mach.,32 (1985), 804–823.
M. Blum, R. W. Floyd, V. R. Rivest, and R. E. Tarjan, Time bound for selection,J. Comput. System Sci.,7 (1972), 448–461.
F. Chin and H. F. Ting, An almost linear time andO (n logn +e) messages distributed algorithm for minimum-weight spanning trees,Proceedings of the Symposium on the Foundations of Computer Science, 1985, pp. 257–266.
N. Frederickson, Tradeoffs for selection in distributed networks,Proceedings of the Second ACM Symposium on Principles of Distributed Computing, 1983, pp. 154–160.
E. Gafni and Y. Afek, Election and traversal in unidirectional networks,Proceedings of the Third ACM Symposium on Principles of Distributed Computing, 1984, pp. 190–198.
G. R. Gallager, P. A. Humblet, and P. M. Spira, A distributive algorithm for minimum weight spanning trees,ACM Trans. Program. Languages Systems,5 (1983), 66–77.
E. Korach, S. Kutten, and S. Morann, A modular technique for the design of efficient distributed leader finding algorithm,Proceedings of the Third ACM Symposium on Principles of Distributed Computing, 1984, pp. 163–174.
E. Korach, S. Moran, and S. Zaks, Tight lower and upper bounds for some distributed algorithms for a complete network of processors,Proceedings of the Third Symposium on Principles of Distributed Computing, 1984, pp. 199–207.
A. T. Matsushita, Distributed algorithms for selection, Technical Report TR-127, University of Illinois at Urbana-Champaign, 1983.
J. J. Munro and M. S. Paterson, Selection and sorting with limited storage,Theoretical Comput. Sci.,12 (1980), 315–323.
M. Rodeh, Finding the median distributively,J. Comput. System Sci.,24 (1982), 162–166.
D. Rotem, N. Santoro, and J. B. Sidney, A shout-echo algorithm for finding the median of a distributed set,Proceedings of the 14th S.E. Conference on Combinatorics, Graph Theory, and Computing, 1983, pp. 311–318.
N. Santoro and B. Sidney, Communication bounds for selection in distributed sets, Technical Report SCS-TR-10, Carleton University, 1982.
A. Schonhage, M. Paterson, and N. Pippenger, Finding the median,J. Comput. System Sci.,18 (1976), 184–199.
L. Shrira, N. Francez, and M. Rodeh, Distributedk-selection: from a sequential to a distributed algorithm,Proceedings of the Second ACM Symposium on Principles of Distributed Computing, 1983, pp. 143–153.
Author information
Authors and Affiliations
Additional information
Communicated by C. K. Wong.
Rights and permissions
About this article
Cite this article
Chin, F., Ting, H.F. An improved algorithm for finding the median distributively. Algorithmica 2, 235–249 (1987). https://doi.org/10.1007/BF01840361
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01840361