By Topic

Asymptotically optimal broadcasting and gossiping in faulty hypercube multicomputers

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

1 Author(s)
Fraigniaud, P. ; LIP-IMAG, CNRS, Ecole Normale Superieure de Lyon, France

Various algorithms for reliable broadcasting (one-to-all) and gossiping (all-to-all) in faulty n-dimensional hypercube multicomputers are described and analyzed. For a broadcast (resp., a gossiping algorithm), the goal is that each processor receives complete information from the source (resp., from all the other processors) even in the presence of faults. One of the main characteristics of the proposed algorithms is that no information on the identity of the faulty nodes/links is required. Exchanges between processors are realized such that multiple copies of the same message move through disjoint paths. Solutions are proposed for systems which use a store-and-forward model of communication, the cost of the message transfer between two neighboring processors being modeled by the sum of a startup time plus a propagation time. Two cases are studied: (1) when processors can simultaneously communicate with all their neighbors at any time, and (2) when communications can take place with only one neighbor at a given time. The algorithms are asymptotically optimal. Optimal solutions for very short messages are also proposed. The speedup of these broadcasting algorithms over those designed for unitary length messages is about a factor of n. The gossiping algorithms require the minimum possible number of time steps and packet transmissions

Published in:

Computers, IEEE Transactions on  (Volume:41 ,  Issue: 11 )