By Topic

A decentralised scheme for multi-node broadcasting on hypercubes

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
$33 $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)
Y. Hayakawa ; Dept. of Electr. Eng., Hiroshima Univ., Japan ; S. Fujita ; M. Yamashita

In this paper, we study the following multi-node broadcast problem on hypercubes, which is an asynchronous and repetitive version of all-to-all broadcast problem. Suppose that nodes of a hypercube asynchronously repeat broadcasting a piece of information called a token. They can asynchronously initiate their broadcasts while other broadcasts are in process. The multi-node broadcast problem, which we discuss in this paper, is the problem of completing each of these broadcasts quickly. It is neither the broadcast problem, which assumes that no nodes initiate a broadcast while a broadcast is in process, nor the gossip problem, which assumes that all nodes initiate broadcasts simultaneously. We propose an adaptive scheme SORT for solving the problem in such a way that each initiator of a broadcast determines the broadcast route based only on local information. The effectiveness of SORT is demonstrated by simulations

Published in:

Parallel Architectures, Algorithms, and Networks, 1997. (I-SPAN '97) Proceedings., Third International Symposium on

Date of Conference:

18-20 Dec 1997