Budget-based resource provisioning and scheduling algorithm for scientific workflows on IaaS cloud

被引:2
作者
Rajasekar, P. [1 ]
Santhiya, P. [1 ]
机构
[1] Sathyabama Inst Sci & Technol, Dept Comp Sci & Engn, Chennai, Tamilnadu, India
关键词
Scientific workflows; Scheduling; Resource provisioning; IaaS cloud; CONCURRENT WORKFLOWS; TIME;
D O I
10.1007/s11042-023-17549-2
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The deployment of cloud computing, specifically Infrastructure as a Service (IaaS) clouds, have become an interested topic in recent years for the execution of compute-intensive scientific workflows. These platforms deliver on-demand connectivity to those infrastructure needed for workflow execution, providing customers to pay only for the service they utilize. As a result schedulers are forced to meet a quid-pro-quo among two main QoS criteria: cost and time. The maximum of this research work has been on making scheduling algorithms with the goal of reducing infrastructure costs as fulfilling a user-specified deadline. Few algorithms, on the other hand, have considered the problem of reducing workflow execution time while staying within a budget. This work consider on the latter scenario. We offer a Budget-based resource Provisioning and Scheduling (BPS) algorithm for scientific workflows used in IaaS service. This proposal was developed to face challenges specifically to clouds like resource performance variation, resource heterogeneity, infinite on-demand connectivity, and pay-as-you-go type (i.e. per-minute pricing). It is efficient of responding to the cloud dynamics, and is powerful in creating suitable solutions that fulfill a user-specified budget and reduce the makespan of the leveraged environment. At last, the experimental events confirms that it runs a workflow efficiently with respect to achieving budget of 94% and minimizing makespan of 29% than the state-of-the-art budget-aware algorithms.
引用
收藏
页码:50981 / 51007
页数:27
相关论文
共 60 条
  • [1] A dynamic VM provisioning and de-provisioning based cost-efficient deadline-aware scheduling algorithm for Big Data workflow applications in a cloud environment
    Ahmad, Wakar
    Alam, Bashir
    Ahuja, Sanchit
    Malik, Sahil
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (01): : 249 - 278
  • [2] A hyper-heuristic cost optimisation approach for Scientific Workflow Scheduling in cloud computing
    Alkhanak, Ehab Nabiel
    Lee, Sai Peck
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 86 : 480 - 506
  • [3] Andonov R., 1994, Proceedings. The International Conference on Application Specific Array Processors (Cat. No.94TH0687-4), P302, DOI 10.1109/ASAP.1994.331794
  • [4] Unbounded knapsack problem: Dynamic programming revisited
    Andonov, R
    Poirriez, V
    Rajopadhye, S
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 123 (02) : 394 - 407
  • [5] Maximizing the completion rate of concurrent scientific applications under time and budget constraints
    Arabnejad, Hamid
    Barbosa, Jorge G.
    [J]. JOURNAL OF COMPUTATIONAL SCIENCE, 2017, 23 : 120 - 129
  • [6] Multi-QoS constrained and Profit-aware scheduling approach for concurrent workflows on heterogeneous systems
    Arabnejad, Hamid
    Barbosa, Jorge G.
    [J]. FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2017, 68 : 211 - 221
  • [7] A Budget Constrained Scheduling Algorithm for Workflow Applications
    Arabnejad, Hamid
    Barbosa, Jorge G.
    [J]. JOURNAL OF GRID COMPUTING, 2014, 12 (04) : 665 - 679
  • [8] Budget and Deadline Aware e-Science Workflow Scheduling in Clouds
    Arabnejad, Vahid
    Bubendorfer, Kris
    Ng, Bryan
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (01) : 29 - 44
  • [9] Arabnejad V, 2016, P IEEE INT C E-SCI, P137, DOI 10.1109/eScience.2016.7870894
  • [10] Bertsekas D., 1992, Data Networks, Vsecond