By Topic

Optimal all-to-all broadcasting schemes in distributed systems

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)
Ming-Syan Chen ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Yu, P.S. ; Kun-Lung Wu

Broadcasting, which refers to a process of information dissemination in a distributed system whereby a message originating from a certain node is sent to all other nodes in the system, is a very important issue in distributed computing. All-to-all broadcasting means the process by which every node broadcasts its certain piece of information to all other nodes. The authors develop optimal all-to-all broadcasting schemes for a distributed system of an arbitrary number of nodes to complete the broadcasting with not only the minimal number of communication steps but also the minimal number of messages. They develop the optimal all-to-all broadcasting scheme for the case of k-port communication, meaning that each node can send out k messages in one communication step where k is a positive integer depending on the system. It is shown that the proposed scheme not only requires the minimal number of communication steps but also incurs the minimal number of messages

Published in:

Parallel and Distributed Information Systems, 1991., Proceedings of the First International Conference on

Date of Conference:

4-6 Dec 1991