基于遗传算法的网格任务调度方法分析  

Analysis of Grid Task Scheduling Method Based on Genetic Algorithm

作　　者：金智[1] 

机构地区：[1]长沙医学院,湖南长沙410219

出　　处：《电脑与电信》2017年第11期9-11,共3页Computer & Telecommunication

基　　金：湖南省教育厅项目:并行遗传算法及其在网格任务调度中的应用研究;项目编号:16C0185

摘　　要：网格任务调度为多项式复杂程度的非确定性问题,其中所有非确定性多项式时间可解的判定问题,共同构成了NP类问题。如何快速地找到全局最优解是网格任务调度的难点所在。而遗传算法在验证猜测的正确性方面,具有自动获取和快速搜索的特性,是解决非线性问题的最优方案。本文主要对基于遗传算法的网格任务调度方法进行分析,通过网格任务调度模型构建、资源分配等操作,来完成遗传算法的仿真实验研究。Grid task scheduling is a non-deterministic problem with polynomial complexity. All uncertain decision problems of polynomial time can constitute NP class problem. So how to quickly find the global optimal solution is the difficult point of grid task scheduling. The genetic algorithm, which has the characteristics of automatic acquisition and fast search, is the best solution to solve the nonlinear problem. This paper mainly analyzes the grid task scheduling method based on genetic algorithm, and completes the simulation experiment research of genetic algorithm through the grid task scheduling model construction, resource allocation and other operations.

关 键 词：遗传算法 网格 任务调度方法 分析 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]