Bruck, Jehoshua and Cypher, Robert and Ho, Ching-Tien (1992) Multiple message broadcasting with generalized Fibonacci trees. In: IEEE Symposium on Parallel and Distributed Processing, 4th, Arlington, TX, 1-4 December 1992. IEEE , Piscataway, NJ, pp. 424-431. ISBN 0-8186-3200-3. https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92b
![]() |
PDF
- Published Version
See Usage Policy. 540kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92b
Abstract
We present efficient algorithms for broadcasting multiple messages. We 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. We give a broadcasting algorithm which requires m + log n + 3 log log n + 15 rounds. In addition, we show a simple lower bound of m +[log n] - 1 rounds for broadcasting in this model.
Item Type: | Book Section | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
Related URLs: |
| |||||||||
ORCID: |
| |||||||||
Additional Information: | © Copyright 1992 IEEE. Reprinted with permission. Meeting Date: 12/01/1992 - 12/04/1992. | |||||||||
Subject Keywords: | message passing; parallel architectures; algorithms; generalized Fibonacci trees; lower bound; multiple message broadcasting; parallel architectures | |||||||||
DOI: | 10.1109/SPDP.1992.242714 | |||||||||
Record Number: | CaltechAUTHORS:BRUispdp92b | |||||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:BRUispdp92b | |||||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
ID Code: | 12404 | |||||||||
Collection: | CaltechAUTHORS | |||||||||
Deposited By: | INVALID USER | |||||||||
Deposited On: | 24 Nov 2008 22:16 | |||||||||
Last Modified: | 08 Nov 2021 22:28 |
Repository Staff Only: item control page