改进蛙跳算法的网格任务调度优化模型  

Optimization Model of Grid Task Scheduling Modified Shuffle Frog Leaping Algorithm

作　　者：杨永强 李淑红 YANG Yongqiang;LI Shuhong(College of Computer and Information, Henan University of Economics and Law, Zhengzhou 450002, Chin)

机构地区：[1]河南财经政法大学计算机与信息工程学院,郑州450002

出　　处：《吉林大学学报（信息科学版）》2018年第2期190-195,共6页Journal of Jilin University（Information Science Edition）

基　　金：国家自然科学基金资助项目(61202285)

摘　　要：为解决当前调度模型存在的局限性,以更好完成网格环境下的任务调度目标,结合网格任务调度的NP(Non-deterministic Polynomial)问题特点,提出了改进蛙跳算法的网格任务调度优化模型。首先以网格任务完成时间作为调度优化指标,然后采用蛙跳算法找到最优的网格任务调度方案,并对蛙跳算法存在不足进行改进,以改善算法工作性能,最后在网格仿真平台Grid Sim上进行性能验证分析。实验结果表明,改进蛙跳算法可较好完成网格任务调度,缩短了任务完成的时间,资源负载更加均衡,而且性能明显要优于其他算法。In order to complete task scheduling in grid environment better,and overcome the limitation of the needle current scheduling model,combined with the characteristics of grid task scheduling is a NP（Nondeterministic Polynomial） problem,this paper proposes a novel grid task scheduling optimization model based on modified SFLA（Shuffled Frog Leaping Algorithm）. First of all,grid task completion time is taken as optimization indicators to establish mathematical model,and then leapfrog algorithm is used to find the best scheme for grid task scheduling,and leapfrog algorithm is modified to solve defect and improve the algorithm speed,the grid performance analysis were validated by Grid Sim. The results show that modified shuffled frog leaping algorithm can complete task scheduling,shorten the task completion time,balance the load of resources, and the performance was obviously superior to the other algorithm.

关 键 词：网格计算 任务调度 蛙跳算法 资源利用率 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]