By Topic

Scheduling Divisible Loads on Bus Networks with Start-Up Costs by Utilizing Multiple Data Transfer Streams: PORI

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)
Jie Hu ; University of California, Irvine, USA ; Raymond Klefstad

The problem of scheduling divisible loads on a distributed bus network with start-up costs is considered. In this paper, we present a novel algorithm to obtain one-round installment load distribution solutions by utilizing multiple data transfer streams. We demonstrate how our proposed algorithm works by means of multiple illustrative examples. We compare the makespan generated by our proposed algorithm with the others in difference cases. We conclude that our proposed algorithm can generate better makespans than others. The analysis provides deeper understanding of scheduling divisible loads in the more realistic model, which will allow us to design more efficient algorithms.

Published in:

2007 International Conference on Parallel Processing (ICPP 2007)

Date of Conference:

10-14 Sept. 2007