Multiple message broadcasting with generalized Fibonacci trees

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.<<ETX>>

[1]  J. L. Holloway,et al.  Fibonacci facts and formulas , 1990 .

[2]  M. Heath,et al.  Matrix factorization on a hypercube multiprocessor , 1985 .

[3]  A. Farley.  Broadcast Time in Communication Networks , 1980 .

[4]  Theodore R. Bashkow,et al.  A large scale, homogeneous, fully distributed parallel machine, I , 1977, ISCA '77.

[5]  Noga Alon,et al.  On Disseminating Information Reliably without Broadcasting , 1987, ICDCS.

[6]  John F. Beetem,et al.  The GF11 supercomputer , 1985, ISCA '85.

[7]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 1992, SPAA '92.

[8]  Dennis Gannon,et al.  On the Impact of Communication Complexity on the Design of Parallel Numerical Algorithms , 1984, IEEE Transactions on Computers.

[9]  Arthur L. Liestman,et al.  A survey of gossiping and broadcasting in communication networks , 1988, Networks.

[10]  C. T. Howard Ho,et al.  Optimal Broadcasting on SIMD Hypercubes without Indirect Addressing Capability , 1991, J. Parallel Distributed Comput..

[11]  S. Lennart Johnsson,et al.  Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures , 1987, J. Parallel Distributed Comput..

[12]  S. Lennart Johnsson,et al.  Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.

[13]  Lennart Johnsson.  Matrix Multiplication on Boolean Cubes using Generic Communication Primitives , 1989 .

[14]  Peter R. Cappello,et al.  Gaussian Elimination on a Hypercube Automaton , 1987, J. Parallel Distributed Comput..