Deep learning and optimization enabled multi-objective for task scheduling in cloud computing

被引:0
作者
Komarasamy, Dinesh [1 ]
Ramaganthan, Siva Malar [2 ]
Kandaswamy, Dharani Molapalayam [3 ]
Mony, Gokuldhev [4 ]
机构
[1] Kongu Engn Coll, Dept Comp Sci & Engn, Erode 638060, Tamil Nadu, India
[2] Jazan Univ, Coll Engn & Comp Sci, Dept Comp Sci, Minist Higher Educ, Jazan, Saudi Arabia
[3] Sathyabama Inst Sci & Technol, Dept Comp Sci & Engn, Chennai, India
[4] Vel Tech Rangarajan Dr Sagunthala R&D Inst Sci & T, Dept Comp Sci & Engn, Chennai, India
关键词
Task scheduling; cloud computing (CC); deep learning (DL); dung beetle optimization (DBO); ALGORITHM; SEARCH;
D O I
10.1080/0954898X.2024.2391395
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In cloud computing (CC), task scheduling allocates the task to best suitable resource for execution. This article proposes a model for task scheduling utilizing the multi-objective optimization and deep learning (DL) model. Initially, the multi-objective task scheduling is carried out by the incoming user utilizing the proposed hybrid fractional flamingo beetle optimization (FFBO) which is formed by integrating dung beetle optimization (DBO), flamingo search algorithm (FSA) and fractional calculus (FC). Here, the fitness function depends on reliability, cost, predicted energy, and makespan, the predicted energy is forecasted by a deep residual network (DRN). Thereafter, task scheduling is accomplished based on DL using the proposed deep feedforward neural network fused long short-term memory (DFNN-LSTM), which is the combination of DFNN and LSTM. Moreover, when scheduling the workflow, the task parameters and the virtual machine's (VM) live parameters are taken into consideration. Task parameters are earliest finish time (EFT), earliest start time (EST), task length, task priority, and actual task running time, whereas VM parameters include memory utilization, bandwidth utilization, capacity, and central processing unit (CPU). The proposed model DFNN-LSTM+FFBO has achieved superior makespan, energy, and resource utilization of 0.188, 0.950J, and 0.238, respectively.
引用
收藏
页码:79 / 108
页数:30
相关论文
共 29 条
[1]   An improved Henry gas solubility optimization algorithm for task scheduling in cloud computing [J].
Abd Elaziz, Mohamed ;
Attiya, Ibrahim .
ARTIFICIAL INTELLIGENCE REVIEW, 2021, 54 (05) :3599-3637
[2]   Optimization of Load Balancing and Task Scheduling in Cloud Computing Environments Using Artificial Neural Networks-Based Binary Particle Swarm Optimization (BPSO) [J].
Alghamdi, Mohammed, I .
SUSTAINABILITY, 2022, 14 (19)
[3]   Task scheduling techniques in cloud computing: A literature survey [J].
Arunarani, A. R. ;
Manjula, D. ;
Sugumaran, Vijayan .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2019, 91 :407-415
[4]   An Efficient and Secure Model Using Adaptive Optimal Deep Learning for Task Scheduling in Cloud Computing [J].
Badri, Sahar ;
Alghazzawi, Daniyal M. M. ;
Hasan, Syed Humaid ;
Alfayez, Fayez ;
Hasan, Syed Hamid ;
Rahman, Monawar ;
Bhatia, Surbhi .
ELECTRONICS, 2023, 12 (06)
[5]  
Bhaladhare P.R., 2014, Advances in Computer Engineering, DOI DOI 10.1155/2014/396529
[6]   Deep residual network based fault detection and diagnosis of photovoltaic arrays using current-voltage curves and ambient conditions [J].
Chen, Zhicong ;
Chen, Yixiang ;
Wu, Lijun ;
Cheng, Shuying ;
Lin, Peijie .
ENERGY CONVERSION AND MANAGEMENT, 2019, 198
[7]   A GSA based hybrid algorithm for bi-objective workflow scheduling in cloud computing [J].
Choudhary, Anubhav ;
Gupta, Indrajeet ;
Singh, Vishakha ;
Jana, Prasanta K. .
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2018, 83 :14-26
[8]   Deep Learning Based Security Model for Cloud based Task Scheduling [J].
Devi, K. ;
Paulraj, D. ;
Muthusenthil, B. .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2020, 14 (09) :3663-3679
[9]  
Ge J., 2017, AIP CONF P, V1834, P118
[10]   A review of different techniques in cloud computing [J].
George, Shelly Shiju ;
Pramila, R. Suji .
MATERIALS TODAY-PROCEEDINGS, 2021, 46 :8002-8008