Multiple message broadcasting with generalized Fibonacci trees

Abstract

The authors present efficient algorithms for broadcasting multiple messages. They assume n processors, one of which contains m packets that it must broadcast to each of the remaining n-1 processors. The processors communicate in rounds. In one round each processor is able to send one packet to any other processor and receive one packet from any other processor. The authors give a broadcasting algorithm which requires m+log n+3 log log n +15 rounds. In addition, they show a simple lower bound of m+(log n) -1 rounds for broadcasting in this model.<>