计算机应用 ›› 2013, Vol. 33 ›› Issue (08): 2154-2157.

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

云计算环境下对资源聚类的工作流任务调度算法

郭凤羽1,禹龙2,田生伟3,于炯3,孙华3   

  1. 1. 新疆大学 信息科学与工程学院,乌鲁木齐 830046;
    2. 新疆大学 网络中心,乌鲁木齐 830046
    3. 新疆大学 软件学院,乌鲁木齐 830008
  • 收稿日期:2013-02-04 修回日期:2013-03-19 出版日期:2013-08-01 发布日期:2013-09-11
  • 通讯作者: 禹龙
  • 作者简介:郭凤羽(1990-),女,河南邓州人,硕士研究生,主要研究方向:云计算、分布式计算;
    禹龙(1974-),女,新疆乌鲁木齐人,副教授,硕士,主要研究方向:计算机网络、计算机智能;
    田生伟(1973-),男,新疆乌鲁木齐人,教授,博士,主要研究方向:云计算、分布式计算、计算机智能;
    于炯(1964-),男,北京人,教授,博士,主要研究方向:云计算、网格与分布式计算、网络安全;
    孙华(1977-),女,新疆喀什人,讲师,博士,主要研究方向:信息安全、信誉管理。
  • 基金资助:

    新疆维吾尔自治区自然科学基金资助项目

Workflow task scheduling algorithm based on resource clustering in cloud computing environment

GUO Fenguu1,YU Long2,TIAN Shengwei3,YU Jiong3,SUN Hua3   

  1. 1. School of Information Science and Engineering, Xinjiang University, Urumqi Xinjiang 830046, China
    2. Network Center, Xinjiang University, Urumqi Xinjiang 830046, China
    3. School of Software, Xinjiang University, Urumqi Xinjiang 830008, China
  • Received:2013-02-04 Revised:2013-03-19 Online:2013-09-11 Published:2013-08-01
  • Contact: YU Long

摘要: 针对云计算环境中资源具有规模庞大、异构性、多样性等特点,提出了一种对资源进行模糊聚类的工作流任务调度算法。经过对网络资源属性进行量化、规范化,以预先构建的任务模型和资源模型为基础,结合模糊数学理论划分资源,使得在任务调度时能够较准确地优先选择综合性能较好的资源类簇,缩短了任务资源相匹配的时间,提高了调度性能。通过仿真实验将此算法与HEFT、DLS进行比较,实验结果表明,当任务在[0,100]范围增加时,该算法平均SLR比HEFT小34%,比DLS小99%,其平均Speedup比HEFT大59%,比DLS大102%;当资源在[0,100]范围增加时,该算法平均SLR比HEFT小36%,比DLS小97%,其平均Speedup比HEFT大45%,比DLS大108%。所提算法实现了对资源的合理划分,且在执行跨度方面具有优越性。

关键词: 云计算, 工作流任务调度, 资源属性, 模糊聚类, 资源划分

Abstract: Focusing on the characteristics of resource under large-scale, heterogeneous and dynamic environment in cloud computing, a workflow task scheduling algorithm based on resource fuzzy clustering was proposed. After quantizing and normalizing the resource characteristics, this algorithm integrated the theory of clustering to divide the resources based on the workflow task model and the resource model constructed in advance. The cluster with better synthetic performance was chosen firstly in scheduling stage. Therefore, it shortened the matching time between the task and the resource, and improved the scheduling performance. By comparing this algorithm with HEFT (Heterogeneous Earliest Finish Time) and DLS (Dynamic Level Scheduling), the experimental results show that the average SLR (Schedule Length Ratio) of this algorithm was smaller than that of HEFT by 3.4%, the DLS by 9.9%, and the average speedup of this algorithm was faster than that of HEFT by 59%, the DLS by 10.2% with the increase of tasks in a certain range of [0,100]; when the resources were increased in a certain range of [0,100], the average SLR of this algorithm was smaller than that of HEFT by 3.6%, the DLS by 9.7%, and the average speedup of this algorithm was faster than that of HEFT by 4.5%, the DLS by 10.8%. The results indicate that the proposed algorithm realizes the reasonable division of resources, and it surpasses HEFT and DLS algorithms in makespan.

Key words: cloud computing, workflow task scheduling, resource characteristics, fuzzy clustering, resource division

中图分类号: