Bit Complexity of Order Statistics on a Distributed Star Network
暂无分享,去创建一个
We study the bit complexity of order statistics problem on an asynchronous distributed star network. We prove a lower bound ofΩ(N log(LN)) bits for the k-selection problem, and lower bounds of Ω(N log(L − N)) bits for the problems of sorting and ranking. For each of the problems we introduce an algorithm that achieves that bound, thus showing all bounds to be optimal.
[1] Nicola Santoro,et al. Distributed Sorting , 1985, IEEE Transactions on Computers.
[2] Michael C. Loui. The Complexity of Sorting on Distributed Systems , 1984, Inf. Control..
[3] Michael Rodeh,et al. Distributed k-selection: From a sequential to a distributed algorithm , 1983, PODC '83.
[4] Shmuel Zaks,et al. Optimal Distributed Algorithms for Sorting and Ranking , 1985, IEEE Transactions on Computers.