Loading

Load Balancing Technique with an Efficient Method
Ranjan Kumar Mondal1, Enakshmi Nandi2, Payel Ray3, Debabrata Sarddar4

1Ranjan Kumar Mondal, Computer Science & Engineering, Universi-ty of Kalyani, WB, India.
2Enakshmi Nandi, Computer Science & Engineering, University of Kalyani, WB, India.
3Payel Ray, Computer Science & Engineering, University of Kalyani, WB, India.
4Dr. Debabrata Sarddar, Computer Science & Engineering, Universi-ty of Kalyani, WB, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 1257-1262 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8394088619/2019©BEIESP | DOI: 10.35940/ijeat.F8394.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: There are a huge number of nodes connected to web computing to offer various types of web services to provide cloud clients. Limited numbers of nodes connected to cloud computing have to execute more than a thousand or a million tasks at the same time. So it is not so simple to execute all tasks at the same particular time. Some nodes execute all tasks, so there is a need to balance all the tasks or loads at a time. Load balance minimiz-es the completion time and executes all the tasks in a particular way. There is no possibility to keep an equal number of servers in cloud computing to execute an equal number of tasks. Tasks that are to be performed in cloud computing would be more than the connected servers. Limited servers have to perform a great number of tasks. We propose a task scheduling algorithm where few nodes perform the jobs, where jobs are more than the nodes and balance all loads to the available nodes to make the best use of the quality of services with load balancing.
Keywords: Load balancing, Cloud Computing, Lowest Com-pletion Time.