当前位置: X-MOL 学术Sustain. Comput. Inform. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A novel multi-objective CR-PSO task scheduling algorithm with deadline constraint in cloud computing
Sustainable Computing: Informatics and Systems ( IF 4.5 ) Pub Date : 2021-08-21 , DOI: 10.1016/j.suscom.2021.100605
Kalka Dubey 1 , S.C. Sharma 1
Affiliation  

In cloud computing, efficient task scheduling espouses many challenges. To schedule the multiple cloudlets with deadline constraints on hybrid cloud resources while meeting the various quality requirements is a challenging issue. The purpose of this research work is to address the task scheduling problem of cloud computing. A novel hybrid task scheduling algorithm named Chemical Reaction Partial Swarm Optimization has been proposed for the allotment of multiple independent tasks on the available virtual machines. It enhances the classical chemical reaction optimization and partial swarm optimization and does hybridization by combining the features for the optimal schedule sequence where tasks can be processed based upon the demand and deadline simultaneously to improve the quality in terms of factors like cost, energy, and makespan. We present the comprehensive simulation experiment using the CloudSim toolkit, which shows the effectiveness of the proposed algorithms. To analyse average execution time, comparative experiments have been carried out using various combinations of virtual machines and the number of tasks. The results bring out a significant reduction in execution time of the order of 1–6 percent, which further improves even more than 10 percent in some cases. The results of the makespan reflect the effectiveness of the algorithm in order of 5–12 percent, and the outcome of total cost 2–10 percent and energy consumption rate shows the 1–9 percent improvement.



中文翻译:

一种新的云计算中具有期限约束的多目标CR-PSO任务调度算法

在云计算中,高效的任务调度面临许多挑战。在满足各种质量要求的同时,在混合云资源上调度具有截止日期限制的多个小云是一个具有挑战性的问题。本研究工作的目的是解决云计算的任务调度问题。已经提出了一种名为化学反应部分群优化的新型混合任务调度算法,用于在可用虚拟机上分配多个独立任务。它增强了经典的化学反应优化和部分群优化,并通过结合最佳调度顺序的特征进行混合,可以根据需求和期限同时处理任务,以提高成本、能源和完工时间等因素的质量. 我们展示了使用 CloudSim 工具包的综合仿真实验,显示了所提出算法的有效性。为了分析平均执行时间,使用虚拟机和任务数量的各种组合进行了比较实验。结果显着减少了 1% 到 6% 的执行时间,在某些情况下甚至可以进一步提高 10% 以上。makespan 的结果反映了算法的效率在 5-12% 之间,总成本 2-10% 和能耗率的结果显示了 1-9% 的改进。已经使用虚拟机和任务数量的各种组合进行了比较实验。结果显着减少了 1% 到 6% 的执行时间,在某些情况下甚至可以进一步提高 10% 以上。makespan 的结果反映了算法的效率在 5-12% 之间,总成本 2-10% 和能耗率的结果显示了 1-9% 的改进。已经使用虚拟机和任务数量的各种组合进行了比较实验。结果显着减少了 1% 到 6% 的执行时间,在某些情况下甚至可以进一步提高 10% 以上。makespan 的结果反映了算法的效率在 5-12% 之间,总成本 2-10% 和能耗率的结果显示了 1-9% 的改进。

更新日期:2021-08-26
down
wechat
bug