计算机应用 ›› 2014, Vol. 34 ›› Issue (9): 2527-2531.DOI: 10.11772/j.issn.1001-9081.2014.09.2527

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

基于任务复制的多维QoS云计算任务调度

张巧龙1,张桂珠1,2,吴德龙1   

  1. 1. 江南大学 物联网工程学院,江苏 无锡 214122;
    2. 轻工过程先进控制教育部重点实验室(江南大学),江苏 无锡 214122
  • 收稿日期:2014-03-20 修回日期:2014-05-24 出版日期:2014-09-01 发布日期:2014-09-30
  • 通讯作者: 张巧龙
  • 作者简介: 
    张巧龙(1988-),男,河南信阳人,硕士研究生,CCF会员,主要研究方向:云计算、数据挖掘;
    张桂珠(1964-),女,江苏无锡人,副教授,主要研究方向:数据挖掘、人工智能、云计算。
  • 基金资助:

    国家自然科学基金资助项目;江苏省自然科学基金资助项目

Multi-dimensional QoS cloud task scheduling algorithm based on task replication

ZHANG Qiaolong1,ZHANG Guizhu1,2,WU Delong1   

  1. 1. School of Internet of Things Engineering, Jiangnan University, Wuxi Jiangsu 214122, China
    2. Key Laboratory of Advanced Process Control for Light Industry of Ministry of Education (Jiangnan University), Wuxi Jiangsu 214122, China
  • Received:2014-03-20 Revised:2014-05-24 Online:2014-09-01 Published:2014-09-30
  • Contact: ZHANG Qiaolong

摘要:

为了满足云计算环境下用户服务质量(QoS)需求和提高虚拟资源空闲时间段的利用率,提出了一种基于任务复制的多维QoS任务调度策略。首先,构建云资源模型和用户QoS模型,然后根据虚拟资源的利用情况和QoS的满意度对虚拟机进行性能测评,选择综合性能更高的虚拟资源进行任务的分配;在任务执行时为了缩短任务的完成时间,在调度过程中引入了在空闲时间段复制父任务的方式。通过仿真实验将该算法与HEFT、CPOP进行比较,实验结果显示:当用户偏好可靠性执行时,该算法平均可靠性比HEFT和CPOP高;当用户偏好完成时间和费用花费执行时,该算法平均完成时间比HEFT和CPOP少;当用户无偏好执行时,该算法平均完成时间和平均花费均比HEFT和CPOP少。结果表明该算法能有效提高资源利用率和用户的满意度。

Abstract:

Under the cloud environment, in order to take full advantage of idle time of virtual resources and meet the user's Quality of Service (QoS) requirements, a multi-dimensional QoS cloud task scheduling algorithm based on task replication was proposed. First, a cloud resource model and a user's QoS model were built. Then according to the utilization of resources and QoS satisfaction, the virtual resource with higher overall performance was chosen. Simultaneously, this algorithm duplicated a parent task in idle time to reduce the execution time. In the comparison experiments with HEFT (Heterogeneous Earliest Finish Time) and CPOP (Critical Path On a Processor), when the user's preferences perform reliability, the average reliability of the proposed algorithm was higher than that of HEFT and CPOP; when the user's preferences perform makespan and cost, the average makespan of the proposed algorithm was smaller than that of HEFT and CPOP; when the user's preferences perform nothing, the average makespan and cost of the proposed algorithm was smaller than that of HEFT and CPOP. The experimental results indicate that the proposed algorithm can improve satisfaction of customers and utilization of resources.

中图分类号: