当前位置: X-MOL 学术J. Circuits Syst. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Effective Metaheuristic Algorithms for Bag-of-Tasks Scheduling Problems Under Budget Constraints on Hybrid Clouds
Journal of Circuits, Systems and Computers ( IF 1.5 ) Pub Date : 2020-10-05 , DOI: 10.1142/s0218126621500912
Linhua Ma 1 , Chunshan Xu 2 , Haoyang Ma 3 , Yujie Li 1 , Jiali Wang 1 , Jin Sun 1
Affiliation  

Cloud computing is an ideal platform for executing bag-of-task (BoT) applications due to its capability of delivering high-quality and pay-per-use computing services. This paper presents a family of genetic algorithm (GA)-based metaheuristics for scheduling the tasks of data-intensive BoT applications on hybrid clouds. The scheduling objective is to minimize the flowtime of BoT applications under a specified budget constraint. We take into account the impact of communication time and communication cost to formulate the optimization model for the data-intensive BoT scheduling problem. By using a task sequence to represent the scheduling solution, the proposed algorithms start with using a low-complexity strategy to generate an initial solution. The generated initial solution is identified as the best chromosome in the initial population of GA framework. We improve the standard crossover operator in GA’s evolutionary procedure by incorporating a probabilistic model. In addition, we design an efficient task dispatching method to evaluate the scheduling quality of each chromosome. Built upon the improved crossover scheme and task dispatching method, the proposed metaheuristic algorithms employ three crossover operators to solve the BoT scheduling problem considered in this work. Extensive experiments are performed to verify the performance of the proposed algorithms in scheduling data-intensive BoT applications.

中文翻译:

混合云预算约束下任务袋调度问题的有效元启发式算法

云计算是执行任务包 (BoT) 应用程序的理想平台,因为它能够提供高质量和按使用付费的计算服务。本文提出了一系列基于遗传算法 (GA) 的元启发式算法,用于在混合云上调度数据密集型 BoT 应用程序的任务。调度目标是在指定的预算约束下最小化 BoT 应用程序的流动时间。我们考虑了通信时间和通信成本的影响,制定了数据密集型 BoT 调度问题的优化模型。通过使用任务序列来表示调度解决方案,所提出的算法首先使用低复杂度策略来生成初始解决方案。生成的初始解被确定为 GA 框架初始种群中的最佳染色体。我们通过结合概率模型改进了 GA 进化过程中的标准交叉算子。此外,我们设计了一种高效的任务调度方法来评估每个染色体的调度质量。基于改进的交叉方案和任务调度方法,所提出的元启发式算法采用三个交叉算子来解决本工作中考虑的 BoT 调度问题。进行了广泛的实验以验证所提出的算法在调度数据密集型 BoT 应用程序中的性能。我们设计了一种高效的任务调度方法来评估每个染色体的调度质量。基于改进的交叉方案和任务调度方法,所提出的元启发式算法采用三个交叉算子来解决本工作中考虑的 BoT 调度问题。进行了广泛的实验以验证所提出的算法在调度数据密集型 BoT 应用程序中的性能。我们设计了一种高效的任务调度方法来评估每个染色体的调度质量。基于改进的交叉方案和任务调度方法,所提出的元启发式算法采用三个交叉算子来解决本工作中考虑的 BoT 调度问题。进行了广泛的实验以验证所提出的算法在调度数据密集型 BoT 应用程序中的性能。
更新日期:2020-10-05
down
wechat
bug