4.5 Article

DCCWOA: A multi-heuristic fault tolerant scheduling technique for cloud computing environment

期刊

PEER-TO-PEER NETWORKING AND APPLICATIONS
卷 16, 期 2, 页码 785-802

出版社

SPRINGER
DOI: 10.1007/s12083-022-01445-x

关键词

Dynamic clustering; Cloud computing; Fault tolerance; Task scheduling; Cuckoo Whale Optimization

向作者/读者索取更多资源

Cloud computing offers on-demand, automatic resource delivery in a transparent manner, but incidental failures during task execution can bring down its performance. Intelligent task scheduling algorithms have been developed, but most neglect fault tolerance, which is crucial for better cloud performance. This research proposes a fault tolerance aware algorithm that effectively addresses failures and improves scheduling performance in the cloud.
On-demand, automatic resource delivery in a transparent manner to users is a remarkable feature offered by the cloud computing environment. User demands are met by dynamically provisioning the cloud resources. Incidental failures during task execution in cloud could be attributed to a variety of reasons. Such failures bring down the cloud performance. Recently, a variety of intelligent task scheduling algorithms have been demonstrated to address several issues in cloud scheduling. Most of these algorithms neglect the fault tolerance criterion, which if addressed appropriately could contribute to better cloud performance. In this research, we had proposed a Dynamic Clustering Cuckoo Whale Optimization Algorithm (DCCWOA) for carrying out efficient scheduling in the cloud by paying equal attention to the fault tolerance parameter. The proposed fault tolerance aware algorithm addresses the scheduling of tasks by maintaining a tab on the currently available resources such that unfortunate failures of autonomous tasks get effectively addressed leading to reduced failures. The performance of the proposed fault tolerance aware DCCWOA has been compared with Ant Colony Optimization algorithm (ACO), Genetic Algorithm (GA) and League Championship Algorithm (LCA)with respect to makespan, failure ratio and failure slowdown parameters under three different scenarios, where in each scenario the number of tasks were appropriately varied. It has been found that the proposed DCCWOA had produced an improvement of 58.19%, 19.88% and 29.32% under scenario 1 for makespan, failure ratio and failure slowdown parameters respectively when compared to ACO, GA and LCA algorithms respectively. Detailed experimental results for scenarios 1, 2 and 3 had been presented in the results section of this article. Results obtained prove the efficacy of the proposed algorithm in overcoming the faults and increasing the scheduling performance of the cloud with respect to the failure rate.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据