David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Paper
Finding the median distributively
Abstract
We consider the problem of computing the median of a bag of 2n numbers by using communicating processes, each having some of the numbers in its local memory. The memories are assumed to be disjoint. For two processes an algorithm is given. Its time and space complexity is linear while the communication complexity is 2 log2 n. A lower bound of log2 n on the communication complexity is derived. Thus the algorithm is optimal up to a constant. © 1982.
Related
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Naga Ayachitula, Melissa Buco, et al.
SCC 2007
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering