By Topic

Scheduling Divisible Loads on Bus Networks with Arbitrary Processor Release Time and Start-Up Costs: XRMI

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 ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Irvine, CA ; Klefstad, R.

We present a novel algorithm to schedule divisible loads using multi-round installment load distribution. This algorithm considers additional real-world factors, such as task initialization overhead and arbitrary processor release times. We analyze this algorithm's properties and demonstrate its behaviors through multiple illustrative examples. The analysis provides both a deeper understanding of the divisible load scheduling difficulties when considering more real-world factors and allows us to design more efficient algorithms. We show that this algorithm generate better solutions for practical applications.

Published in:

Performance, Computing, and Communications Conference, 2007. IPCCC 2007. IEEE Internationa

Date of Conference:

11-13 April 2007