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 条
  • [21] A LINEAR-PROGRAMMING APPROACH TO THE CUTTING STOCK PROBLEM .2.
    GILMORE, PC
    GOMORY, RE
    [J]. OPERATIONS RESEARCH, 1963, 11 (06) : 863 - 888
  • [22] Hilman MH, 2020, Arxiv, DOI arXiv:1903.01113
  • [23] Task-based Budget Distribution Strategies for Scientific Workflows with Coarse-grained Billing Periods in IaaS Clouds
    Hilman, Muhammad Hafizhuddin
    Rodriguez, Maria A.
    Buyya, Rajkumar
    [J]. 2017 IEEE 13TH INTERNATIONAL CONFERENCE ON E-SCIENCE (E-SCIENCE), 2017, : 128 - 137
  • [24] DCHG-TS: a deadline-constrained and cost-effective hybrid genetic algorithm for scientific workflow scheduling in cloud computing
    Iranmanesh, Amir
    Naji, Hamid Reza
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (02): : 667 - 681
  • [25] Jackson K. R., 2010, Proceedings of the 2010 IEEE 2nd International Conference on Cloud Computing Technology and Science (CloudCom 2010), P159, DOI 10.1109/CloudCom.2010.69
  • [26] A divide and conquer approach to deadline constrained cost-optimization workflow scheduling for the cloud
    Khojasteh Toussi, Ghazaleh
    Naghibzadeh, Mahmoud
    [J]. CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (03): : 1711 - 1733
  • [27] ATSDS: adaptive two-stage deadline-constrained workflow scheduling considering run-time circumstances in cloud computing environments
    Khorsand, Reihaneh
    Safi-Esfahani, Faramarz
    Nematbakhsh, Naser
    Mohsenzade, Mehran
    [J]. JOURNAL OF SUPERCOMPUTING, 2017, 73 (06) : 2430 - 2455
  • [28] Patterns in the Chaos-A Study of Performance Variation and Predictability in Public IaaS Clouds
    Leitner, Philipp
    Cito, Juergen
    [J]. ACM TRANSACTIONS ON INTERNET TECHNOLOGY, 2016, 16 (03)
  • [29] Multi-resource scheduling and power simulation for cloud computing
    Lin, Weiwei
    Xu, Siyao
    He, Ligang
    Li, Jin
    [J]. INFORMATION SCIENCES, 2017, 397 : 168 - 186
  • [30] Design and theoretical analysis of virtual machine placement algorithm based on peak workload characteristics
    Lin, Weiwei
    Xu, SiYao
    Li, Jin
    Xu, Lingling
    Peng, Zhiping
    [J]. SOFT COMPUTING, 2017, 21 (05) : 1301 - 1314