Each vertex of an undirected graph possesses a piece of information th
at must be sent to every other vertex. They communicate by sending bou
nded size packets of messages from one vertex to another. The authors
describe parallel algorithms, which accomplish the desired tasks for s
ix prominent architectures. The algorithms are optimal, or nearly so,
in every case.