By Topic

Parallel algorithms using unreliable broadcasts

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

2 Author(s)
J. Matthews ; Dept. of Comput. Sci., California Univ., Davis, CA, USA ; C. Martel

Parallel computing on networks of workstations (NOWs) allows effective use of existing hardware and software. NOWs are often connected using a broadcast medium such as an Ethernet, so it is natural to use broadcast as a communication primitive. However, existing parallel programs usually rely on point-to-point protocols for performing broadcasts since native broadcast schemes (UDP broadcast) do not guarantee delivery. Thus the potential of the broadcast medium is lost. Instead of making the broadcast reliable, we design algorithms which use an unreliable broadcast. Our algorithms are correct regardless of the reliability of the broadcast, but are more efficient the higher the reliability. We provide experimental results which show that UDP broadcasts are quite reliable in practice and can be used to design efficient minimum spanning tree and load balancing algorithms for NOWs

Published in:

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Date of Conference:

15-19 Apr 1996