Multiple message broadcasting in the postal model

Broadcasting is a widely used operation in many message-passing systems. Most existing broadcasting algorithms, however, do not address several emerging trends in distributed-memory parallel computers and high-speed communication networks. These trends include (i) treating the system as a fully connected collection of processors, (ii) packetizing large data into sequences of messages, and (iii) tolerating communication latencies. This paper explores the broadcasting problem in the postal model that addresses these issues. The authors provide two algorithms for broadcasting m messages in a message-passing system with n processors and communication latency λ. A lower bound on the time for this problem is (m-1)+f _λ(n), where f_λ(n) is the optimal time for broadcasting one message. They present algorithm PARTITION that takes at most 2m+f_λ(n)+O (λ) time, and algorithm D-D-TREES that takes at most m +2f_λ(n)+O(λ) time