Abstract

Cloud Computing is becoming a dominant trend in providing information technology (IT) services. The cloud comprises many hardware and software resources today, and more people are switching to such services. Users' requests for cloud resources must incur a minimum amount of load on the system while getting a rapid response. In the cloud today, there is too much computational power. Load balancing makes it possible for various components of the cloud computing environment to work efficiently. To balance client requests to available resources so that the system is not overloaded, and the requested resources are delivered as quickly as possible, an effective load balancing strategy is essential. In this research article, we have presented a critical analysis of various existing cloud load balancing and scheduling algorithms. Several task scheduling approaches have been proposed in the literature review, but there appears to be a lack of scheduling algorithms for real-time task works based on historical scheduling records (HSR). The proposed algorithm uses information available in HSR to efficiently distributes incoming user requests to available virtual machines. The proposed scheduling algorithm uses the scaleup and scale down resource algorithm which helps in achieving maximum resource utilization. The algorithm tries to balance the load on VMs by scaling up and down cloud resources. WorkflowSim is used to analyze the performance of the algorithm proposed. The simulation results are compared with the existing scheduling algorithm which shows the proposed algorithm outperforms existing scheduling algorithms in terms of makespan.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.