An Adaptive Genetic Algorithm for the Grid Scheduling Problem
Grid computing is a service that shares computational power and data storage capacity over the Internet. The goal of grid tasks scheduling is to achieve high system throughput and to match the application need with the available computing resources. Aiming at the evolution characteristics of genetic algorithm (GA), an adaptive genetic algorithm (AGA) is presented in this paper. The AGA is used to solve the grid scheduling problem. It can keep all the advantages of the standard GA, such as implementation simplicity, low computational burden, and few control parameters, etc. A set of experiments show that the algorithm is stable and presents low variability. The preliminary results obtained in this research are auspicious. We analyze the laboratory results to show that the modified algorithm has better characteristics than standard GA and Max-Min algorithm when it was used in task scheduling.
grid task scheduling adaptive genetic algorithm makespan
ZHOU Wei BU Yan-ping
School of Business, East China University of Science and Technology, Shanghai, 200237 School of Technology, Shanghai Jiaotong University, Shanghai, 201101
国际会议
The 24th Chinese Control and Decision Conference (第24届中国控制与决策学术年会 2012 CCDC)
太原
英文
730-734
2012-05-23（万方平台首次上网日期，不代表论文的发表时间）