Title :
Parallel algorithms for information dissemination by packets
Author :
Bagchi, A. ; Schmeichel, E.F. ; Hakimi, S.L.
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;
Conference_Titel :
Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
Conference_Location :
Dallas, TX
Print_ISBN :
0-8186-2310-1
DOI :
10.1109/SPDP.1991.218269
