Designing Efficient Distributed Algorithms Using Sampling Techniques

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 k n), on a p-processor de Bruijn network, our deterministic selection algorithm can find the kth smallest key from F using O(p log3 p) messages and with a communication delay of O(log3 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 ...

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Sanguthevar Rajasekaran, David S. L. Wei
• Keywords: Communication Delay, Distributed And Parallel Computing, File Size, IPPS 1997, Selection Algorithms