An Improved Task Scheduling Algorithm for Heterogeneous Systems
Research in task scheduling algorithm is a challenging problem for high-performance computing; especially achieving a better make span 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 algorithms high availability.
Feng Ding KenLi Li
School of Computer and Communication, University of Hunan,Changsha 410082, China
国际会议
三亚
英文
90-94
2009-04-24（万方平台首次上网日期，不代表论文的发表时间）