DocumentCode
3163364
Title
Parallel algorithms for information dissemination by packets
Author
Bagchi, A. ; Schmeichel, E.F. ; Hakimi, S.L.
fYear
1991
fDate
2-5 Dec 1991
Firstpage
274
Lastpage
281
Abstract
Each vertex of an undirected graph possesses a piece of information which must be sent to every other vertex. The method of communication is to send bounded size packets of messages from one vertex to another. We describe parallel algorithms to accomplish the desired tasks for five prominent architectures. The algorithms are optimal, or nearly so, in every case
Keywords
communication complexity; parallel algorithms; communication; distributed computing; information dissemination; packets of messages; parallel algorithms; parallel computing; undirected graph; Broadcasting; Communication system control; Computer architecture; Computer science; Distributed computing; Finishing; Mathematics; Multiprocessing systems; Parallel algorithms; Time measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location
Dallas, TX
Print_ISBN
0-8186-2310-1
Type
conf
DOI
10.1109/SPDP.1991.218269
Filename
218269
Link To Document