Multi Objective Task Scheduling in Cloud Computing Using Cat Swarm Optimization Algorithm

Autor: Sangram Keshari Swain, Sudheer Mangalampalli, Vamsi Krishna Mangalampalli
Rok vydání: 2021
Předmět:
Zdroj: Arabian Journal for Science and Engineering. 47:1821-1830
ISSN: 2191-4281
2193-567X
DOI: 10.1007/s13369-021-06076-7
Popis: Efficient Scheduling of tasks is essential in cloud computing to provision the virtual resources to the tasks, effectively by minimizing makespan and maximizing resource utilization in cloud computing. Existing scheduling algorithms talks about makespan and resource utilization, but very few authors addressed the issues named as migration time, energy consumption, total power cost in datacenters. These three mentioned metrics are essential in the view of cloud provider, as by minimizing migration time, energy consumption and total power cost in datacenters cloud provider will be directly benefited. This paper introduces task scheduling by using Cat Swarm Optimization algorithm, which addresses the parameters makespan, migration time, Energy Consumption and Total Power Cost at Datacenters. Scheduling of tasks were done by calculating priorities of tasks at task level, and calculating priorities of VMs at VM level to schedule appropriate mapping of tasks onto VMs. It is implemented by using cloudsim simulator and input to the algorithm is generated randomly from the cloudsim for total power cost, we have used HPC2N and NASA workloads, which are parallel workload archives, which were given as an input to the algorithm. Proposed algorithm is compared against existing algorithms like PSO and CS. From the simulation results, we have observed that we got a significant improvement in different parameters when we used HPC2N and NASA workloads. Makespan is improved by 16%, 10%, 27%, 20% by using HPC2N and NASA workload over PSO and CS algorithms, respectively. Energy Consumption is minimized by 22%, 12%, 31%, 21% by using HPC2N and NASA workload over PSO and CS algorithms, respectively. Total Power cost is minimized by 31% and 39% over PSO and CS algorithms, respectively. Migration time is minimized by 34%, 29%, 20%, 14% by using HPC2N and NASA workloads over PSO and CS algorithms, respectively.
Databáze: OpenAIRE
Externí odkaz: