Parallel Information Dissemination by Packets
Copyright policy )Parallel Information Dissemination by Packets
Summary: Each vertex of an undirected graph possesses a piece of information that must be sent to every other vertex. They communicate by sending bounded size packets of messages from one vertex to another. The authors describe parallel algorithms, which accomplish the desired tasks for six prominent architectures. The algorithms are optimal, or nearly so, in every case.
Network design and communication in computer systems, Graph theory (including graph drawing) in computer science, Distributed algorithms, parallel gossiping, parallel algorithms, algorithms for parallel communication on networks, interprocessor communication
Network design and communication in computer systems, Graph theory (including graph drawing) in computer science, Distributed algorithms, parallel gossiping, parallel algorithms, algorithms for parallel communication on networks, interprocessor communication
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).16 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!