Packet routing and PRAM emulation on star graphs and leveled networks
Journal of Parallel and Distributed Computing
Introduction to distributed algorithms
Introduction to distributed algorithms
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Expected time bounds for selection
Communications of the ACM
Computer Algorithms: C++
Unifying Themes for Network Selection
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Distributed k-selection: From a sequential to a distributed algorithm
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Tradeoffs for selection in distributed networks (Preliminary Version)
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Journal of Computer and System Sciences
Efficient selection and sorting schemes using coteries for processing large distributed files
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, selection can be done in such a way that the message complexity is independent of the cardinality of the set (file), provided the file size is polynomial in the network size. For example, given a file F of size n and an integer k(1\leq k\leq n), on a p-processor de Bruijn network, our deterministic selection algorithm can find the kth smallest key from F using O(p\log^{3}p) messages and with a communication delay of O(\log^{3}p), and that our randomized selection algorithm can finish the same task using only O(p) messages and a communication delay of O(\log p) with high probability, provided the file size is polynomial in network size. Our randomized selection outperforms the existing approaches in terms of both message complexity and communication delay.The property that the number of messages needed and the communication delay are independent of the size of the file makes our distributed selection schemes extremely attractive in such domains as very large database systems. Making use of our selection algorithms to select pivot element(s), we also develop a near optimal quicksort-based sorting scheme and a nearly optimal enumeration sorting scheme for sorting large distributed files on the hypercube and de Bruijn networks. Our algorithms are fully distributed without any a priori central control.