This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Broadcast Communications and Distributed Algorithms
March 1986 (vol. 35 no. 3)
pp. 210-219
R. Dechter, Department of Computer Science, University of California
The paper addresses ways in which one can use "broadcast communication" in distributed algorithms and the relevant issues of design and complexity. We present an algorithm for merging k sorted lists of n/k elements using k processors and prove its worst case complexity to be 2n, regardless of the number of processors, while neglecting the cost arising from possible conflicts on the broadcast channel. We also show that this algorithm is optimal under single-channel broadcast communication. In a variation of the algorithm, we show that by using an extra local memory of O(k) the number of broadcasts is reduced to n. When the algorithm is used for sorting n elements with k processors, where each processor sorts its own list first and then merging, it has a complexity of O(n/k log(n/k) + n), and is thus asymptotically optimal for large n. We also discuss the cost incurred by the channel access scheme and prove that resolving conflicts whenever k processors are involved introduces a cost factor of at least log k.
Index Terms:
sorting, Access scheme, broadcast, complexity analysis, distributed algorithm, merging, parallel algorithms
Citation:
R. Dechter, L. Kleinrock, "Broadcast Communications and Distributed Algorithms," IEEE Transactions on Computers, vol. 35, no. 3, pp. 210-219, March 1986, doi:10.1109/TC.1986.1676745
Usage of this product signifies your acceptance of the Terms of Use.