FFBAT: A security and cost-aware workflow scheduling approach combining firefly and bat algorithms

被引:21
|
作者
Arunarani, A. R. [1 ]
Manjula, D. [1 ]
Sugumaran, Vijayan [2 ]
机构
[1] Anna Univ India, Dept Comp Sci & Engn, Madras, Tamil Nadu, India
[2] Oakland Univ, Dept Decis & Informat Sci, Rochester, MI 48063 USA
来源
CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE | 2017年 / 29卷 / 24期
关键词
Bat algorithm; computational cost; Firefly algorithm; risk rate; security; workflow scheduling; CLOUD;
D O I
10.1002/cpe.4295
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Cloud computing is distributed computing on a large scale driven by practical and effective operations, in which a pay-per-use framework provides dynamic scaling in response to the needs of workflow applications. Many existing cloud computing environments do not effectively employ security measures to counter security threats in task scheduling. To improve the scheduling system, we include security service to the scheduling process. However, adding security services to applications inevitably causes overhead in terms of computation time. The tradeoff between achieving high computing performance and providing the desired level of security protection imposes a big challenge for task scheduling. To solve this problem, we propose a security and cost aware scheduling algorithm for heterogeneous tasks in scientific workflow executed in a cloud. Our proposed algorithm is based on the hybrid optimization approach, which combines Firefly and Bat algorithms. The coding strategy is to minimize the total execution cost while meeting the deadline and risk rate constraints. The proposed system uses a multi-objective function, and the results indicate that our algorithm always outperforms the traditional algorithms.
引用
收藏
页数:13
相关论文
共 50 条
  • [1] Privacy-aware and cost-aware workflow scheduling in clouds
    Wen Y.
    Liu J.
    Chen C.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2016, 22 (02): : 294 - 301
  • [2] Optimal Algorithms and a PTAS for Cost-Aware Scheduling
    Chen, Lin
    Megow, Nicole
    Rischke, Roman
    Stougie, Leen
    Verschae, Jose
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 211 - 222
  • [3] A Cost-Aware Scheduling Algorithm for Reliable Workflow in IaaS Clouds
    Ye, Lingjuan
    Xia, Yuanqing
    Yang, Liwen
    PROCEEDINGS OF THE 33RD CHINESE CONTROL AND DECISION CONFERENCE (CCDC 2021), 2021, : 275 - 280
  • [4] Dynamic multi-workflow scheduling: A deadline and cost-aware approach for commercial clouds
    Arabnejad, Vahid
    Bubendorfer, Kris
    Ng, Bryan
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 100 : 98 - 108
  • [5] Cost-aware and privacy-aware workflow scheduling strategy in hybrid clouds
    Wen Y.
    Wang Z.
    Liu J.
    Xu X.
    Chen A.
    Cao B.
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2020, 26 (06): : 1582 - 1588
  • [6] Deadline-constrained cost-aware workflow scheduling in hybrid cloud
    Hussain, Mehboob
    Luo, Ming-Xing
    Hussain, Abid
    Javed, Muhammad Hafeez
    Abbas, Zeeshan
    Wei, Lian-Fu
    SIMULATION MODELLING PRACTICE AND THEORY, 2023, 129
  • [7] Cost-aware cloud workflow scheduling using DRL and simulated annealing
    Yan Gu
    Feng Cheng
    Lijie Yang
    Junhui Xu
    Xiaomin Chen
    Long Cheng
    Digital Communications and Networks, 2024, 10 (06) : 1590 - 1599
  • [8] Cost-aware cloud workflow scheduling using DRL and simulated annealing
    Gu, Yan
    Cheng, Feng
    Yang, Lijie
    Xu, Junhui
    Chen, Xiaomin
    Cheng, Long
    DIGITAL COMMUNICATIONS AND NETWORKS, 2024, 10 (06) : 1590 - 1599
  • [9] Cost-aware DAG scheduling algorithms for minimizing execution cost on cloud resources
    Moïse W. Convolbo
    Jerry Chou
    The Journal of Supercomputing, 2016, 72 : 985 - 1012
  • [10] Cost-aware DAG scheduling algorithms for minimizing execution cost on cloud resources
    Convolbo, Moise W.
    Chou, Jerry
    JOURNAL OF SUPERCOMPUTING, 2016, 72 (03): : 985 - 1012