Abstract
In cloud computing, resource provisioning is a key challenging task due to dynamic resource provisioning for the applications. As per the workload requirements of the application’s resources should be dynamically allocated for the application. Disparities in resource provisioning produce energy, cost wastages, and additionally, it affects Quality of Service (QoS) and increases Service Level Agreement (SLA) violations. So, applications allocated resources quantity should match with the applications required resources quantity. Load balancing in cloud computing can be addressed through optimal scheduling techniques, whereas this solution belongs to the NP-Complete optimization problem category. However, the cloud providers always face resource management issues for variable cloud workloads in the heterogeneous system environment. This issue has been solved by the proposed Predictive Priority-based Modified Heterogeneous Earliest Finish Time (PMHEFT) algorithm, which can estimate the application’s upcoming resource demands. This research contributes towards developing the prediction-based model for efficient and dynamic resource provisioning in a heterogamous system environment to fulfill the end user’s requirements. Existing algorithms fail to meet the user’s Quality of Service (QoS) requirements such as makespan minimization and budget constraints satisfaction, or to incorporate cloud computing principles, i.e., elasticity and heterogeneity of computing resources. In this paper, we proposed a PMHEFT algorithm to minimize the makespan of a given workflow application by improving the load balancing across all the virtual machines. Experimental results show that our proposed algorithm’s makespan, efficiency, and power consumption are better than other algorithms.
Highlights
Load balancing is a crucial factor in optimizing cloud resources, i.e., compute, storage, and networking [1]
The results show that the studied scheduling algorithms, Priority-based Modified Heterogeneous Earliest Finish Time (PMHEFT) unveils the best performance with the lowest quadratic time complexity for the dynamic scheduling of directed acyclic graph (DAG) in heterogeneous platforms
This research proposed a new method for task scheduling and loaded balancing to improve user response time and incoming tasks
Summary
Load balancing is a crucial factor in optimizing cloud resources, i.e., compute, storage, and networking [1]. When cloud consideration takes place, usually load balancing technique highly requires to distribute the task load among. A. MOTIVATION In IT industries, different cloud providers fulfill QoS to end clients as indicated by their requirements. MOTIVATION In IT industries, different cloud providers fulfill QoS to end clients as indicated by their requirements As a result, it brings about a varying number of clients over a period. It brings about a varying number of clients over a period It embodies that static resource provisioning may tend towards inefficiency to resource handling.
Published Version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have