By Topic

Approximation algorithms for information dissemination problems

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

2 Author(s)
Fraigniaud, P. ; Lab. d''Inf. du Parallelisme, Ecole Normale Superieure de Lyon, France ; Vial, S.

Broadcasting and gossiping are basic tools for high performance programming on parallel and distributed systems. Unfortunately they are known to be NP-hard problems. The paper deals with approximation algorithms far broadcasting and gossiping. The authors consider both round-complexity and step-complexity in the telephone model. After an overview of previously derived approximation algorithms, they present new strategies for broadcasting and gossiping in any networks. Broadcasting strategies are based on the construction of edge-disjoint spanning trees. Gossiping strategies are based on on-line computation of matching a slang with the gossiping process. The approximation algorithms for broadcasting offer almost optimal complexity when the number of messages to be broadcasted is large. They show that the best approximation algorithm for gossiping performs optimally in many cases. They also show experimentally that it performs faster than the best known hand-made algorithms in some particular cases

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996