地理分布数据中心的工作流经济高效资源分配

Cost-efficient resource allocation algorithm for scientific workflow accross geo-distributed data centers

针对工作流作业跨数据中心传输产生高额流量费用的场景,对跨地理分布数据中心工作流作业资源分配问题进行了分析并建模,使用启发的贪心思想提出了MCCD算法,并将本文算法与常见的几种资源分配算法进行了对比。实验的结果验证了本文算法在跨地理分布数据中心的工作流作业中,可以有效降低用户通信流量资费平均达40%,对于降低用户跨地理分布数据中心的通信资费有明显的帮助。

Cloud operators charge bandwidth fees for data from user jobs that are transferred between data centers,and this accounts for a large percentage of user spending.It is of practical significance for users to reduce the communication overhead of the submitted job significantly without affecting the completion of the job through reasonable assignment of tasks and resources when determining the leased resources.This paper analyzes and models the traffic cost problem across data centers when workflow tasks are distributed in geographically distributed data centers,and proposes a heuristic algorithm for solving the problem.Several sets of experiments are carried out on the proposed algorithm,and the results are compared with that of the resource allocation algorithms commonly used in the current practice..The experimental results verify that the heuristic algorithm proposed in this paper can effectively reduce the user communication traffic cost by at least 9.75%in the workflow operation across the geo-distributed data center,which serves to reduce the communication fee between users across geo-distributed data centers.