Optimal multiple message broadcasting in telephone-like communication systems

Amotz Bar-Noy, Shlomo Kipnis, Baruch Schieber

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations

Abstract

We consider the problem of broadcasting multiple messages from one processor to many processors in telephone-like communication systems. In such systems, processors communicate in rounds, where in every round, each processor can communicate with exactly one other processor by exchanging messages with it. Finding an optimal solution for this problem was open for over a decade. In this paper, we present an optimal algorithm for this problem when the number of processors is even. For an odd number of processors, we provide an algorithm which is within an additive term of 1 of the optimum. A by-product of our solution is an algorithm for the problem of broadcasting multiple messages for any number of processors in the simultaneous send/receive model. In this latter model, in every round, each processor can send a message to one processor and receive a message from another processor.

Original languageEnglish (US)
Pages (from-to)216-223
Number of pages8
JournalIEEE Symposium on Parallel and Distributed Processing - Proceedings
StatePublished - Dec 1 1994
Externally publishedYes
EventProceeedings of the 6th IEEE Symposium on Parallel and Distributed Processing - Dallas, TX, USA
Duration: Oct 26 1994Oct 29 1994

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'Optimal multiple message broadcasting in telephone-like communication systems'. Together they form a unique fingerprint.

Cite this