Load Balancing of Unbalanced Assignment Problem With Hungarian Method

Load Balancing of Unbalanced Assignment Problem With Hungarian Method

Ranjan Kumar Mondal (Department of Computer Science and Engineering, University of Kalyani, Kalyani, India), Payel Ray (Department of Computer Science and Engineering, University of Kalyani, Kalyani, India), Enakshmi Nandi (Department of Computer Science and Engineering, University of Kalyani, Kalyani, India), Biswajit.Biswas (Department of Business Administration, University of Kalyani, Kalyani, India), Manas Kumar Sanyal (Department of Business Administration, University of Kalyani, Kalyani, India) and Debabrata Sarddar (Department of Computer Science and Engineering, University of Kalyani, Kalyani, India)
Copyright: © 2019 |Pages: 15
DOI: 10.4018/IJACI.2019010103

Abstract

The cloud computing presents a type of assignments and systems which occupy distributed resources to execute a role in a distributed way. Cloud computing make use of the online systems on the web to assist the implementation of complicated assignments; that need huge-scale computation. It was said with the intention of in our living world; we can find it challenging to balance workloads of cloud computing among assignments (jobs or tasks) and systems (machines or nodes), so the majority of the time we have to promote a condition to unbalanced assignment problems (unequal task allocations). The present article submits a new technique to solve the unequal task allocation problems. The technique is offered in an algorithmic model and put into practice on the several groups of input to investigate the presentation and usefulness of the works. An evaluation is prepared with the presented approach. It makes sure that the proposed approach provides a better outcome by comparing with some other existing algorithms.
Article Preview
Top

1. Introduction

Load balancing (Mondal, Ray, & Sarddar, 2016) with task scheduling is thought about to be a major subject in cloud computing system. The claim for valuable load balancing with task scheduling enhances to accomplish major-performance computing. In general, it is not easy to locate best resource distribution to minimize the schedule of assignments and successfully make use of these properties. The most important stages of load balancing are resource finding, collecting resource data and task implementation.

Cloud user’s execution their application as a distributed application. Then the users submit their assignments to cloud resource broker. The resource broker then queries the cloud information service for the accessibility of assets and to identify their properties. The cloud properties are registered within one or more cloud server. The resource servers are responsible for scheduling the jobs on the properties that equivalent job’s requirements. Behind scheduling the property, provider monitors the execution of jobs, and after completion, it collects the results and sends back to the users.

Greater numbers of load balancing algorithms are accessible to reduce the make-span (Mell & Grance, 2011; Mirtaheri & Grandinetti, 2017; Wang, Yan, Liao, & Wang, 2010; Xiao et al., 2017; Dasgupta, Mandal, Dutta, Mandal & Dam, 2013; Kamalam & Anitha, 2017; Kokilavani & Amalarethinam, 2011). Each and every one these algorithms attempt to discover properties to be assigned to the assignments which will reduce the in general execution time of the tasks. Reducing total execution time of all assignments does not signify that it decreases the actual finishing time of the individual assignment. Two simple algorithms utilized for load balancing are Min-Min (Wang, Yan, Liao, & Wang, 2010) and LBMM (Kokilavani & Amalarethinam, 2011). These two algorithms effort by considering the implementation and execution time of all tasks on all accessible cloud computing.

The Min-Min first discovers the least finishing time from all tasks. Then it decides the task with the smallest finishing time among all current tasks. This approach proceeds by conveying the tasks to the properties that generate the least finishing time. The same method is repeated by Min-Min until all jobs are scheduled.

The constraint of the Min-Min is it decides smallest tasks foremost which composers use of the resource. Accordingly, the schedule shaped by Min-Min is not good while some slighter tasks go beyond the big ones.

To stay away from the disadvantages of the Min-Min, many superior algorithms have been advised. All the problems talked about in those algorithms are taken and analyzed to provide a further efficient schedule. Our proposed approach in this paper outperforms all those approaches both regarding make-span and load balancing. As a result, improved load balancing is attained and the total response time of the cloud system is developed. The planned program applied the Min-Min policy in the first stage and then reschedule by allowing for the maximum finishing time that is minimum than the make-span gained from the first segment.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 11: 4 Issues (2020): 1 Released, 3 Forthcoming
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 2 Issues (2016)
Volume 6: 2 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing