Load Balancing with preemptive and non-preemptive task scheduling in Cloud Computing

TL;DR

This paper examines load balancing in cloud computing through preemptive and non-preemptive task scheduling algorithms, aiming to optimize resource utilization and reduce costs in dynamic virtualized environments.

Contribution

It analyzes various task scheduling algorithms for dynamic resource allocation, highlighting their adaptability and performance in cloud load balancing scenarios.

Findings

Different scheduling algorithms improve resource utilization.

Preemptive scheduling offers better load handling.

Non-preemptive scheduling reduces task interruption.

Abstract

In Cloud computing environment the resources are managed dynamically based on the need and demand for resources for a particular task. With a lot of challenges to be addressed our concern is Load balancing where load balancing is done for optimal usage of resources and reduces the cost associated with it as we use pay-as-you-go policy. The task scheduling is done by the cloud service provider using preemption and non-preemption based on the requirements in a virtualized scenario which has been focused here. In this paper, various task scheduling algorithms are studied to present the dynamic allocation of resources under each category and the ways each of this scheduling algorithm adapts to handle the load and have high-performance computing