By Topic

Minimizing broadcast costs under edge reductions in tree networks

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)
Hambrusch, S.E. ; Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA ; Hyeong-Seok Lim

We study the broadcasting of messages in the single-port, blocking communication model under edge reductions. Edge reductions model the decrease or elimination of broadcast costs on edges. Let T be an n-vertex tree and B be a target broadcast cost. We present an O(n) time algorithm for determining which edges to reduce (i.e., assign cost 0) such that the number of reduced edges is a minimum and a broadcast initiated at a vertex in a determined center set costs at most B. We present an O(n log n) time algorithm to minimize the cost of a broadcast initiated at an arbitrary vertex

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997