By Topic

Accelerating divisible load distribution on tree and pyramid networks using pipelined communications

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)
Keqin Li ; Dept. of Comput. Sci., State Univ. of New York, New Paltz, NY, USA

Summary form only given. We propose two methods which employ pipelined communications to distribute divisible loads on tree and pyramid networks. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic speedup of both methods is 6β+1 for a complete b-ary tree network and 4β+1 for a pyramid network, where β is the ratio of the time for computing a unit load to the time for communicating a unit load.

Published in:

Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International

Date of Conference:

26-30 April 2004