电信科学 ›› 2019, Vol. 35 ›› Issue (2): 1-13.doi: 10.11959/j.issn.1000-0801.2019035

• 研究与开发 •    下一篇

基于格分布方差的多目标云工作流调度算法

包晓安1,曹云棣1,张娜1,钱俊彦2,曹建文3   

  1. 1 浙江理工大学,浙江 杭州 310018
    2 桂林电子科技大学,广西 桂林 541004
    3 中国科学院软件研究所,北京100190
  • 修回日期:2019-01-01 出版日期:2019-02-01 发布日期:2019-02-23
  • 作者简介:包晓安(1973- ),男,浙江理工大学教授,主要研究方向为云计算、自适应软件和智能信息处理。|曹云棣(1990- ),女,浙江理工大学硕士生,主要研究方向为云计算、智能计算与分布式处理。|张娜(1977- ),女,浙江理工大学副教授,主要研究方向为分布式数据处理、软件工程。|钱俊彦(1973- ),男,桂林电子科技大学教授,主要研究方向为软件工程、软件分析和云计算。|曹建文(1969- ),男,中国科学院软件研究所博士生导师,主要研究方向为高性能并行软件与算法的研究与开发。
  • 基金资助:
    国家自然科学基金资助项目(61502430);国家自然科学基金资助项目(61562015);广西省自然科学基金资助项目(2015GXNSFDA139038);浙江理工大学521人才培养计划资助项目

Multi-objective cloud workflow scheduling algorithm based on grid variance

Xiaoan BAO1,Yundi CAO1,Na ZHANG1,Junyan QIAN2,Jianwen CAO3   

  1. 1 Zhejiang Sci-Tech University,Hangzhou 310018,China
    2 Guilin University of Electronic Technology,Guilin 541004,China
    3 Chinese Academy of Sciences,Beijing 100190,China
  • Revised:2019-01-01 Online:2019-02-01 Published:2019-02-23
  • Supported by:
    The National Natural Science Foundation of China(61502430);The National Natural Science Foundation of China(61562015);Guangxi Natural Science Foundation of China(2015GXNSFDA139038);521 Talent Project of Zhejiang Sci-Tech University

摘要:

提出了基于格分布方差的多目标云工作流调度算法和差粒子自学习策略。首先,考虑任务调度的特性,进行粒子编码离散化。其次,利用 Pareto 最优工作流调度解集映射到自适应网格坐标系的策略,计算网格坐标系中每个Pareto最优解的格分布量。再次,采用格分布方差评估当前Pareto前端的多样性程度,并动态调整进化策略。最后,设计了差粒子自学习策略。仿真实验表明,通过该算法得到的工作流调度解集,在IGD和S性能指标上均优于MOPSO算法,在最优值方面优于ε-FDPSO和NSGA-Ⅱ算法。

关键词: 云工作流调度, 多目标优化, 粒子群算法, 网格坐标系, 格分布方差, 动态调整

Abstract:

Multi-objective cloud workflow scheduling algorithm based on grid variance and the strategy of bad particles self-learning were presented.Firstly,the characteristics of task scheduling was token into consideration,and particle encoding was discredited.Secondly,the strategy of mapping Pareto optimal workflow scheduling set to self-adaptive grid coordinate system,and calculating the grid distribution value of each Pareto optimal solution was used.Thirdly,grid variance was adopted to evaluate the diversity of current Pareto front and dynamically adjust evolution strategies.Finally,the concept of being dominated times was introduced into bad particles self-learning strategy for filtering out bad particles in population.The simulation experiment shows that workflow scheduling solution set by this algorithm is better than the MOPSO algorithm on both IGD and S performance indexes,and the optimal value is superior to the ε-FDPSO and NSGA-Ⅱ algorithm.

Key words: cloud workflow scheduling, multi-objective optimization, particle swarm algorithm, grid variance, dynamic adjustment

中图分类号: 

No Suggested Reading articles found!