Amazing technological breakthrough possible @S-Logix pro@slogix.in

Office Address

  • #5, First Floor, 4th Street Dr. Subbarayan Nagar Kodambakkam, Chennai-600 024 Landmark : Samiyar Madam
  • pro@slogix.in
  • +91- 81240 01111

Social List

A dynamic load scheduling in IaaS cloud using binary JAYA algorithm - 2020

Research Area:  Cloud Computing

Abstract:

Datacenters receive dynamic workloads with disparate specifications to be scheduled on virtual machines (VMs). These unpredictable, alarmingly growing workloads with varying resource specifications may bring down the servers of datacenters into an imbalanced state. Thus, resulting in low resource utilization and high energy consumption among the servers. To cater to the need of fluctuating on-demand resource provisioning, it is essential to scale up the ability and capacityof existing infrastructure through virtualization. Moreover, due to the involvement of conflicting scheduling constraints, load scheduling in cloud computing fall under NP-hard problem. An effective scheduling mechanism in amalgamation with a load balancing strategy based on binary JAYA is implemented to alleviate the challenges as mentioned above. This technique not only improves resource utilization but also brings down the degree of energy consumption and makespan while keeping the whole system balanced. At first, it focuses on evoking a load balancing procedure to uniformly disperse the loads among VMs based on the compatibility between the tasks and VMs and secondly, JAYA algorithm is executed to find the best possible mapping of tasks onto VMs. In order to appraise the efficacy of the proposed algorithm, the scheduling of independent and non-preemptive tasks is simulated in CloudSim using a benchmark parallel workload by NASA-iPSC. Experiments are conducted in both homogenous and heterogeneous environments. The proposed algorithm is statistically validated using the Friedman test, followed by a Holms test. The proposed approach is compared over other algorithms such as Round Robin (RR), binary Particle Swarm Optimization (PSO) and Genetic Algorithm (GA). The simulation results show a notable amelioration over other mentioned algorithms by an increase of resource utilization with 18.47% (GA), 12.65% (BPSO) and 4.18% (GA), 2.51% (BPSO) and a reduction of makespan by 6.47% (GA), 4.35% (BPSO) and 4.17% (GA), 2.20% (BPSO) with an increasing number of tasks and VMs in two different test cases respectively.

Author(s) Name:  Kaushik Mishra,Jharashree Pati,Santosh Kumar Majhi

Journal name:  Journal of King Saud University - Computer and Information Sciences

Conferrence name:  

Publisher name:  Elsevier

DOI:  10.1016/j.jksuci.2020.12.001

Volume Information:  Volume 2020