Cart (Loading....) | Create Account
Close category search window
 

An Improved Task Scheduling Algorithm for Heterogeneous Systems

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)
Feng Ding ; Sch. of Comput. & Commun., Univ. of Hunan, Changsha, China ; Kenli Li

Research in task scheduling algorithm is a challenging problem for high-performance computing; especially achieving a better makespan is a key issue in design and development of heterogeneous algorithm. In this paper, we investigate an existing scheduling algorithm and consider the problem of minimizing its makespan. We have formulated our problem as a nonlinear programming model, and then used the genetic algorithm to solve that problem. Experimental results show that the makespan of our new algorithm is proved shorter than those of the two existing scheduling algorithms, while still maintaining the algorithm's high availability.

Published in:

Computational Sciences and Optimization, 2009. CSO 2009. International Joint Conference on  (Volume:1 )

Date of Conference:

24-26 April 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.