Energy efficient task scheduling using adaptive PSO for cloud computing

被引:8
|
作者
Rani R. [1 ]
Garg R. [1 ]
机构
[1] Computer Engineering Department, National Institute of Technology, Kurukshetra
关键词
Cloud computing; Energy consumption; Independent task scheduling; Makespan; Particle swarm optimisation; PSO;
D O I
10.1504/IJRIS.2021.114630
中图分类号
学科分类号
摘要
Cloud computing is an important research domain where all computational resources are networked globally and shared to users easily. Cloud service provider (CSP) wants the eco-friendly solution to resolve these issues. To enhance the performance of cloud computing resources, task scheduling is of prime concern. Further, the growth of cloud computing resources leads to a large amount of energy consumption and carbon footprints. Thus, this paper aims to reduce the makespan along with energy consumption for independent tasks. For this purpose, we proposed energy efficient adaptive particle swarm optimisation (EE-APSO) algorithm for independent tasks scheduling decision. Each particle represents a potential solution, and small position value (SPV) rule is used to change continuous particle position vector to discrete particle position vector. PSO is made adaptive by varying acceleration coefficients and inertia weight. We also introduced mutation operation to avoid the PSO algorithm getting stuck in local minima and explore the whole search space efficiently. Result analysis demonstrated that our proposed algorithm EE-APSO using SPV rule gives better results than min-min, max-min and genetic algorithm (GA) in terms of makespan and energy consumption. Copyright © 2021 Inderscience Enterprises Ltd.
引用
下载
收藏
页码:50 / 58
页数:8
相关论文
共 50 条
  • [41] QRAS: efficient resource allocation for task scheduling in cloud computing
    Harvinder Singh
    Anshu Bhasin
    Parag Ravikant Kaveri
    SN Applied Sciences, 2021, 3
  • [42] Efficient task scheduling on virtual machine in cloud computing environment
    Alam, Mahfooz
    Mahak
    Haidri, Raza Abbas
    Yadav, Dileep Kumar
    INTERNATIONAL JOURNAL OF PERVASIVE COMPUTING AND COMMUNICATIONS, 2021, 17 (03) : 271 - 287
  • [43] QRAS: efficient resource allocation for task scheduling in cloud computing
    Singh, Harvinder
    Bhasin, Anshu
    Kaveri, Parag Ravikant
    SN APPLIED SCIENCES, 2021, 3 (04):
  • [44] An efficient task scheduling in a cloud computing environment using hybrid Genetic Algorithm - Particle Swarm Optimization (GA-PSO) algorithm
    Kumar, A. M. Senthil
    Parthiban, K.
    Shankar, Siva S.
    PROCEEDINGS OF THE 2019 INTERNATIONAL CONFERENCE ON INTELLIGENT SUSTAINABLE SYSTEMS (ICISS 2019), 2019, : 29 - 34
  • [45] Efficient Task Scheduling in Cloud Computing using an Improved Particle Swarm Optimization Algorithm
    Peng, Guang
    Wolter, Katinka
    CLOSER: PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND SERVICES SCIENCE, 2019, : 58 - 67
  • [46] Q-learning based dynamic task scheduling for energy-efficient cloud computing
    Ding, Ding
    Fan, Xiaocong
    Zhao, Yihuan
    Kang, Kaixuan
    Yin, Qian
    Zeng, Jing
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2020, 108 : 361 - 371
  • [47] Task Scheduling and Server Provisioning for Energy-Efficient Cloud-Computing Data Centers
    Liu, Ning
    Dong, Ziqian
    Rojas-Cessa, Roberto
    2013 33RD IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS (ICDCSW 2013), 2013, : 226 - 231
  • [48] Energy-Efficient Dynamic Computation Offloading and Cooperative Task Scheduling in Mobile Cloud Computing
    Guo, Songtao
    Liu, Jiadi
    Yang, Yuanyuan
    Xiao, Bin
    Li, Zhetao
    IEEE TRANSACTIONS ON MOBILE COMPUTING, 2019, 18 (02) : 319 - 333
  • [49] Survey on energy efficient scheduling techniques on cloud computing
    Kaur, Nirmal
    Bansal, Savina
    Bansal, Rakesh Kumar
    MULTIAGENT AND GRID SYSTEMS, 2021, 17 (04) : 351 - 366
  • [50] Energy-aware task scheduling in mobile cloud computing
    Tang, Chaogang
    Hao, Mingyang
    Wei, Xianglin
    Chen, Wei
    DISTRIBUTED AND PARALLEL DATABASES, 2018, 36 (03) : 529 - 553