计算机应用 ›› 2016, Vol. 36 ›› Issue (1): 107-112.DOI: 10.11772/j.issn.1001-9081.2016.01.0107

• 先进计算 • 上一篇    下一篇

基于离散人工蜂群算法的云任务调度优化

倪志伟1,2, 李蓉蓉1,2, 方清华1,2, 庞闪闪1,2   

  1. 1. 合肥工业大学 管理学院, 合肥 230009;
    2. 过程优化与智能决策教育部重点实验室(合肥工业大学), 合肥 230009
  • 收稿日期:2015-07-06 修回日期:2015-09-08 出版日期:2016-01-10 发布日期:2016-01-09
  • 通讯作者: 李蓉蓉(1990-),女,福建泉州人,硕士研究生,主要研究方向:群智能算法、云计算
  • 作者简介:倪志伟(1963-),男,安徽合肥人,教授,博士生导师,博士,主要研究方向:人工智能、机器学习、云计算;方清华(1990-),女,广西南宁人,硕士研究生,主要研究方向:群智能算法、数据挖掘;庞闪闪(1989-),女,河南开封人,硕士研究生,主要研究方向:群智能算法、数据挖掘。
  • 基金资助:
    国家自然科学基金资助项目(71271071);国家自然科学基金重点资助项目(71490725);国家863计划项目(2011AA040501)。

Optimization of cloud task scheduling based on discrete artificial bee colony algorithm

NI Zhiwei1,2, LI Rongrong1,2, FANG Qinghua1,2, PANG Shanshan1,2   

  1. 1. School of Management, Hefei University of Technology, Hefei Anhui 230009, China;
    2. Key Laboratory of Process Optimization and Intelligent Decision-Making, Ministry of Education (Hefei University of Technology), Hefei Anhui 230009, China
  • Received:2015-07-06 Revised:2015-09-08 Online:2016-01-10 Published:2016-01-09
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (71271071), the Key Project of National Natural Science Foundation of China (71490725) and the National High Technology Research and Development Program (863 Program) of China (2011AA040501).

摘要: 针对现今云计算任务调度只考虑单目标和云计算应用对虚拟资源的服务的质量要求高等问题,综合考虑了用户最短等待时间、资源负载均衡和经济原则,提出一种离散人工蜂群(ABC)算法的云任务调度优化策略。首先,从理论上建立了云任务调度的多目标数学模型;然后,结合偏好满意度策略并引入局部搜索算子和改变侦察蜂搜索方式,提出多目标离散型人工蜂群(MDABC)算法的优化策略。通过不同的云任务调度仿真实验,显示了改进离散人工蜂群算法相对于基础离散人工蜂群算法、遗传算法以及经典贪心算法,能够得到较高的综合满意度,表明了改进离散人工蜂群算法能够更好地改善虚拟资源中云任务调度系统的性能,具有一定的普适性。

关键词: 云任务调度, 离散型人工蜂群算法, 云计算, 优化策略, 偏好满意度策略

Abstract: To meet high quality requirement of virtual resource service in cloud computing applications and solve the problem that cloud computing task scheduling only consider single objective currently, a Discrete Artificial Bee Colony (DABC) algorithm for cloud task scheduling optimization was proposed by considering the users' shortest waiting time, resource load balancing and economic principle. First, the multi-objective mathematical model of cloud task scheduling was established in theory. Second, by combining with preference satisfaction policy, introducing the local search operator and changing the searching way of scout bee, an optimizing strategy based on the Multi-objective DABC (MDABC) algorithm was proposed to solve the problem. Different cloud task scheduling simulation experimental results show that the proposed MDABC algorithm can obtain higher comprehensive satisfaction than the basic DABC algorithm, Genetic Algorithm (GA) and classical greedy algorithm. Thus, the proposed MDABC algorithm can better improve the performance of cloud task scheduling in virtual resource system, and its universality is better.

Key words: cloud task scheduling, Discrete Artificial Bee Colony (DABC) algorithm, cloud computing, optimization strategy, preference satisfaction policy

中图分类号: