Broadcasting Multiple Messages in Simultaneous Send/receive Systems

Abstract We investigate the problem of broadcasting multiple messages in a message-passing system that supports simultaneous send and receive. The system consists of n processors, one of which has m messages to broadcast to the other n − 1 processors. The processors communicate in rounds. In each round, a processor can simultaneously send a message to one processor and receive a message from another processor. The goal is to broadcast the m messages among the n processors in the minimal number of communication rounds. The lower bound on the number of rounds required is (m − 1) + ⌈log n⌉. We present an algorithm for this problem that requires at most m + ⌈log n⌉ communication rounds, for any values of m and n.

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

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

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

[4]  Shay Kutten,et al.  New models and algorithms for future networks , 1988, PODC '88.

[5]  Israel Cidon,et al.  Paris: An approach to integrated high‐speed private networks , 1988 .

[6]  Dennis G. Shea,et al.  Architecture and implementation of Vulcan , 1994, Proceedings of 8th International Parallel Processing Symposium.

[7]  Amotz Bar-Noy,et al.  Multiple message broadcasting in the postal model , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.

[8]  W. David Sincoskie,et al.  The AURORA Gigabit Testbed , 1993, Comput. Networks ISDN Syst..

[9]  A. M. Farley.  Minimal broadcast networks , 1979, Networks.

[10]  Jehoshua Bruck,et al.  Multiple message broadcasting with generalized Fibonacci trees , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

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

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

[13]  W. Daniel Hillis,et al.  The network architecture of the Connection Machine CM-5 (extended abstract) , 1992, SPAA '92.

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