Distributed Algorithms for Multi-Channel Broadcast Networks

Abstract

A distributed algorithm is time-space optimal if it achieves optimal speedup and if it uses only a constant amount of extra space when the number of processors is fixed. In this brief paper, we outline a distributed algorithm for merging that, given a multi-channel broadcast network with k processors, merges two sorted lists of total length n in O(n/b+logk) time and O(k) extra space, and are thus time-space optimal for any fixed value of IC that satisfies n 2 klogk.