文献类型：会议论文

英文题名：An Adaptive Genetic Algorithm for the Grid Scheduling Problem

作者：Zhou Wei[1];Bu Yan-ping[2]

机构：[1]E China Univ Sci & Technol, Sch Business, Shanghai 200237, Peoples R China;[2]Shanghai Jiaotong Uni, Sch Technol, Shanghai 201101, Peoples R China

会议论文集：24th Chinese Control and Decision Conference (CCDC)

会议日期：MAY 23-25, 2012

会议地点：Taiyuan, PEOPLES R CHINA

语种：英文

外文关键词：grid; task scheduling; adaptive genetic algorithm; makespan

摘要：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.