吉林大学学报(信息科学版)

• 论文 • 上一篇    下一篇

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

杨永强, 李淑红   

  1. 河南财经政法大学计算机与信息工程学院, 郑州450002
  • 收稿日期:2017-06-27 出版日期:2018-03-24 发布日期:2018-07-25
  • 作者简介:杨永强(1974—), 男, 河南鄢陵人, 河南财经政法大学讲师, 硕士, 主要从事云计算和数据挖掘研究, (Tel)86-13673600120(E-mail)yongqiang1974@ yeah. net。
  • 基金资助:
    国家自然科学基金资助项目(61202285)

Optimization Model of Grid Task Scheduling Modified Shuffle Frog Leaping Algorithm

YANG Yongqiang, LI Shuhong   

  1. College of Computer and Information, Henan University of Economics and Law, Zhengzhou 450002, China
  • Received:2017-06-27 Online:2018-03-24 Published:2018-07-25
  • Supported by:
     

摘要: 为解决当前调度模型存在的局限性, 以更好完成网格环境下的任务调度目标, 结合网格任务调度的NP(Non-deterministic Polynomial)问题特点, 提出了改进蛙跳算法的网格任务调度优化模型。首先以网格任务完成时间作为调度优化指标, 然后采用蛙跳算法找到最优的网格任务调度方案, 并对蛙跳算法存在不足进行改进,以改善算法工作性能, 最后在网格仿真平台GridSim 上进行性能验证分析。实验结果表明, 改进蛙跳算法可较好完成网格任务调度, 缩短了任务完成的时间, 资源负载更加均衡, 而且性能明显要优于其他算法。

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

Abstract: 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 ( Non-deterministic 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 GridSim. 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.

Key words: task scheduling, leapfrog algorithm, grid computing, resource utilization

中图分类号: 

  • TP311