Distributed sorting algorithms for multi-channel broadcast networks

AbstractA multi-channel broadcast network is a distributed computation model in which p independent processors communicate over a set of p shared broadcast channels. Computation proceeds in synchronous cycles, during each of which the processors first write and read the channels, then perform local computations. Performance is measured in terms of the number of cycles used in the computation, where each bit to be transmitted is assumed to require a separate cycle. In this paper we investigate the problem of sorting p bit strings of uniform length m, each string initially located at a different processor in the broadcast network. We develop an efficient sorting method that first reduces the length of the strings without affecting their relative order, then proceeds using only the shorter strings. A sequence of three successively improved algorithms based on this approach is presented, the best of which runs in O(m + p log p) cycles. By showing a lower bound of Ω(m) cycles, we prove that the algorithm is optimal for sufficiently large m. Our results improve by a factor of log p the solution of the multiple identification problem presented by Landau, Yung and Galil (1985)