Enhanced Task Scheduling Using Optimized Particle Swarm Optimization Algorithm in Cloud Computing Environment

被引:0
|
作者
Potluri, Sirisha [1 ]
Hamad, Abdulsattar Abdullah [2 ]
Godavarthi, Deepthi [3 ]
Basa, Santi Swarup [4 ]
机构
[1] ICFAI Foundatio Higher Educ, Fac Sci & Technol, Dept Comp Sci & Engn, IcfaiTech, Hyderabad, India
[2] Samarra Univ, Coll Educ, Dept Phys, Samarra, Iraq
[3] VIT AP Univ, Sch Comp Sci & Engn, Amaravati, Andhra Prades, India
[4] Maharaja Sriram Chandra Bhanjadeo Univ, Baripada, Odisha, India
关键词
Cloud Computing; Load Balancing; High-Performance Computing; Task Scheduling; Job Scheduling; Particle Swarm Optimization; LOAD BALANCING ALGORITHM;
D O I
10.4108/eetsis.4042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The most significant constraint in cloud computing infrastructure is the job/task scheduling which affords the vital role of efficiency of the entire cloud computing services and offerings. Job/ task scheduling in cloud infrastructure means that to assign best appropriate cloud resources for the given job/task by considering of different factors: execution time and cost, infrastructure scalability and reliability, platform availability and throughput, resource utilization and makespan. The proposed enhanced task scheduling algorithm using particle swarm optimization considers optimization of makespan and scheduling time. We propose the proposed model by using dynamic adjustment of parameters with discrete positioning (DAPDP) based algorithm to schedule and allocate cloud jobs/tasks that ensues optimized makespan and scheduling time. DAPDP can witness a substantial role in attaining reliability in by seeing the available, scheduled and allocated cloud resources. Our approach DAPDP compared with other existing particle swarm and optimization job/task scheduling algorithms to prove that DAPDP can save in makespan, scheduling and execution time.
引用
收藏
页码:1 / 5
页数:5
相关论文
共 50 条
  • [31] Task scheduling of cloud computing based on hybrid particle swarm algorithm and genetic algorithm
    Xueliang Fu
    Yang Sun
    Haifang Wang
    Honghui Li
    Cluster Computing, 2023, 26 : 2479 - 2488
  • [32] Hybrid swarm optimization algorithm based on task scheduling in a cloud environment
    Eldesokey, Heba M.
    Abd El-atty, Saied M.
    El-Shafai, Walid
    Amoon, Mohammed
    Abd El-Samie, Fathi E.
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2021, 34 (13)
  • [33] A Particle Swarm Optimization Based Pareto Optimal Task Scheduling in Cloud Computing
    Beegom, A. S. Ajeena
    Rajasree, M. S.
    ADVANCES IN SWARM INTELLIGENCE, ICSI 2014, PT II, 2014, 8795 : 79 - 86
  • [34] An improved particle swarm optimization algorithm for scheduling tasks in cloud environment
    Wang, Zi-Ren
    Hu, Xiao-Xiang
    Wei, Peng
    Yuan, Bo
    EXPERT SYSTEMS, 2024, 41 (07)
  • [35] Task scheduling in a cloud computing environment using HGPSO algorithm
    A. M. Senthil Kumar
    M. Venkatesan
    Cluster Computing, 2019, 22 : 2179 - 2185
  • [36] Chicken swarm optimization in task scheduling in cloud computing
    Han L.
    International Journal of Performability Engineering, 2019, 15 (07): : 1929 - 1938
  • [37] Task scheduling in a cloud computing environment using HGPSO algorithm
    Kumar, A. M. Senthil
    Venkatesan, M.
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1): : 2179 - 2185
  • [38] An Optimized Scheduling Algorithm on a Cloud Workflow Using a Discrete Particle Swarm
    Cao, Jianfang
    Chen, Junjie
    Zhao, Qingshan
    CYBERNETICS AND INFORMATION TECHNOLOGIES, 2014, 14 (01) : 25 - 39
  • [39] Artificial Flora Optimization Algorithm for Task Scheduling in Cloud Computing Environment
    Bacanin, Nebojsa
    Tuba, Eva
    Bezdan, Timea
    Strumberger, Ivana
    Tuba, Milan
    INTELLIGENT DATA ENGINEERING AND AUTOMATED LEARNING - IDEAL 2019, PT I, 2019, 11871 : 437 - 445
  • [40] Enhanced Butterfly Optimization Algorithm for Task Scheduling in Cloud Computing Environments
    ZHAO, Yue
    International Journal of Advanced Computer Science and Applications, 2024, 15 (12) : 435 - 443