By Topic

Parallel algorithms for information dissemination by packets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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

Published in:

Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on

Date of Conference:

2-5 Dec 1991