{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:11:19Z","timestamp":1757452279294},"reference-count":12,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/ijaci.2019010103","type":"journal-article","created":{"date-parts":[[2018,10,8]],"date-time":"2018-10-08T17:18:26Z","timestamp":1539019106000},"page":"46-60","source":"Crossref","is-referenced-by-count":3,"title":["Load Balancing of Unbalanced Assignment Problem With Hungarian Method"],"prefix":"10.4018","volume":"10","author":[{"given":"Ranjan Kumar","family":"Mondal","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Kalyani, Kalyani, India"}]},{"given":"Payel","family":"Ray","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Kalyani, Kalyani, India"}]},{"given":"Enakshmi","family":"Nandi","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Kalyani, Kalyani, India"}]},{"family":"Biswajit.Biswas","sequence":"additional","affiliation":[{"name":"Department of Business Administration, University of Kalyani, Kalyani, India"}]},{"given":"Manas Kumar","family":"Sanyal","sequence":"additional","affiliation":[{"name":"Department of Business Administration, University of Kalyani, Kalyani, India"}]},{"given":"Debabrata","family":"Sarddar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Kalyani, Kalyani, India"}]}],"member":"2432","reference":[{"key":"IJACI.2019010103-0","doi-asserted-by":"crossref","unstructured":"Chen, H., Wang, F., Helian, N., & Akanmu, G. (2013). User-priority guided Min-Min scheduling algorithm for load balancing in cloud computing. In 2013National Conference on Parallel Computing Technologies (PARCOMPTECH). IEEE.","DOI":"10.1109\/ParCompTech.2013.6621389"},{"key":"IJACI.2019010103-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2013.12.369"},{"key":"IJACI.2019010103-2","author":"G. K.Kamalam","year":"2017","journal-title":"Anitha"},{"issue":"2","key":"IJACI.2019010103-3","first-page":"43","article-title":"Load balanced Min-min algorithm for static meta-task scheduling in grid computing.","volume":"20","author":"T.Kokilavani","year":"2011","journal-title":"International Journal of Computers and Applications"},{"key":"IJACI.2019010103-4","doi-asserted-by":"crossref","unstructured":"Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval research logistics quarterly, 2(1\u20102), 83-97.","DOI":"10.1002\/nav.3800020109"},{"key":"IJACI.2019010103-5","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.09.056"},{"key":"IJACI.2019010103-6","doi-asserted-by":"crossref","unstructured":"Mell, P., & Grance, T. (2011). The NIST definition of cloud computing.","DOI":"10.6028\/NIST.SP.800-145"},{"key":"IJACI.2019010103-7","article-title":"Dynamic load balancing in distributed exascale computing systems.","author":"S. L.Mirtaheri","year":"2017","journal-title":"Cluster Computing"},{"key":"IJACI.2019010103-8","unstructured":"Mondal, R. K., Ray, P. & Sarddar, D. (2016). Load Balancing. International Journal of Research in Computer Applications & Information Technology, 4(1)."},{"key":"IJACI.2019010103-9","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2008.080403"},{"key":"IJACI.2019010103-10","unstructured":"Wang, S. C., Yan, K. Q., Liao, W. P., & Wang, S. S. (2010). Towards a Load Balancing in a three-level cloud computing network. In Computer Science and Information Technology (pp. 108\u2014113)."},{"key":"IJACI.2019010103-11","doi-asserted-by":"crossref","unstructured":"Xiao, Z., Tong, Z., Li, K., & Li, K. (2017). Learning non-cooperative game for load balancing under self-interested distributed environment. Applied Soft Computing, 52, 376-386.","DOI":"10.1016\/j.asoc.2016.10.028"}],"container-title":["International Journal of Ambient Computing and Intelligence"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=216469","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T23:55:39Z","timestamp":1651881339000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJACI.2019010103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijaci.2019010103","relation":{},"ISSN":["1941-6237","1941-6245"],"issn-type":[{"value":"1941-6237","type":"print"},{"value":"1941-6245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}