A dynamic VM provisioning and de-provisioning based cost-efficient deadline-aware scheduling algorithm for Big Data workflow applications in a cloud environment

被引:0
作者
Wakar Ahmad
Bashir Alam
Sanchit Ahuja
Sahil Malik
机构
[1] Jamia Millia Islamia,Department of Computer Engineering, Faculty of Engineering and Technology
来源
Cluster Computing | 2021年 / 24卷
关键词
Big Data; Cloud computing; Quality of service (QoS); Resource provisioning; Workflow scheduling;
D O I
暂无
中图分类号
学科分类号
摘要
Cloud computing is the fastest growing distributed computing paradigm that provides online IT resources on demand by following a pay-as-you-go billing model. The success of this computing paradigm enables cloud providers to offer an extensive collection of parallel computing resources to deal with Big Data workflow scheduling problems. Although, workflow scheduling has been extensively studied, however, most of them are unable to achieve user-specified deadline constraints at the cheap cost. In this paper, a Dynamic Cost-Efficient Deadline-Aware (DCEDA) heuristic algorithm is proposed for scheduling Big Data workflow that produces the cheapest schedule while achieving the deadline constraints. DCEDA dynamically takes appropriate scheduling decisions for workflow tasks based on the fact that deadline constraint is not violated in the future. Also, it continuously monitors the VM pool for identifying the active idle VMs that incur extra costs and overheads, and subsequently de-provision them. The experimental analysis based on Montage workflow and randomly generated synthetic workflow with various characteristics prove that DCEDA delivers better performance in comparison to the existing algorithms.
引用
收藏
页码:249 / 278
页数:29
相关论文
共 88 条
[1]  
Berman F(2005)New grid scheduling and rescheduling methods in the GrADS project Int. J. Parallel Prog. 33 209-229
[2]  
Casanova H(2005)Pegasus: a framework for mapping complex scientific workflows onto distributed systems Sci. Program. 13 219-237
[3]  
Chien A(2005)Scheduling of scientific workflows in the ASKALON grid environment ACM SIG MOD Rec. 34 56-62
[4]  
Cooper K(1996)Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors IEEE Trans. Parallel Distrib. Syst. 7 506-521
[5]  
Dail H(1992)Designing high-throughput VLC decoder. I. Concurrent VLSI architectures IEEE Trans. Circuits Syst. Video Technol. 2 187-196
[6]  
Dasgupta A(2009)Comparative analysis of quality of service and memory usage for adaptive failure detectors in healthcare systems IEEE J. Sel. Areas Commun. 27 495-509
[7]  
Deng W(2004)Particle swarm based data mining algorithms for classification tasks Parallel Comput. 30 767-783
[8]  
Dongarra J(2015)Efficient motion and disparity estimation optimization for low complexity multiview video coding IEEE Trans. Broadcast. 61 166-176
[9]  
Johnsson L(2010)Runtime measurements in the cloud: observing, analyzing, and reducing variance Proc. VLDB Endoment 3 460-471
[10]  
Kennedy K(2009)Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility Future Gener. Comput. Syst. 25 599-616