Abstract
It has been stated that in our real life states, we can find it challenging to balance among tasks and machines, so most of the time we have to look a condition to unbalanced assignment problems. The present paper submits a new technique for solving the unbalanced assignment problems. The method is accomplished by conveying all the jobs to machine optimally. The method is presented in an algorithmic model and implemented on the several sets of input data to investigate the performance and effectiveness of the algorithm. The developed algorithm is coded in Java. An assessment is also prepared with the existing approach, And it is recorded that our algorithm gives better results.
This is a preview of subscription content, log in via an institution to check access.
References
Mondal, R.K., Ray, P., Sarddar, D.: Load balancing. Int. J. Res. Comput. Appl. Inform. Technol. 4(1), 01–21 (2016). ISSN 2347- 5099, Print: 2348- 0009, DOA: 03012016
Mell, P., Grance, T.: The NIST Definition of Cloud Computing (2011)
Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel distrib. Comput. 7(2), 279–301 (1989)
Wang, S.C., Yan, K.Q., Liao, W.P., Wang, S.S.: Towards a load balancing in a three level cloud computing network. In: Computer Science and Information Technology, pp. 108—113 (2010)
Ritchie, G., Levine, J.: A fast, effective local search for scheduling independent jobs in heterogeneous computing environments (2003)
Dasgupta, K., Mandal, B., Dutta, P., Mandal, J.K., Dam, S.: A genetic algorithm (GA) based load balancing strategy for cloud computing. Procedia Technol. 10, 340–347 (2013)
Armstrong, R., Hensgen, D., Kidd, T.: The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In: Proceedings, 1998 Seventh Heterogeneous Computing Workshop, (HCW 1998), pp. 79–87. IEEE, March 1998
Kokilavani, T., DI George, A.: Load balanced Min-Min algorithm for static meta-task scheduling in grid computing. Int. J. Comput. Appl. 20(2), 43–49 (2011)
Chen, H., Wang, F., Helian, N., Akanmu, G.: User-priority guided Min-Min scheduling algorithm for load balancing in cloud computing. In: 2013 National Conference on Parallel Computing Technologies (PARCOMPTECH), pp. 1–8. IEEE (2013)
Nace, D., Pióro, M.: Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Commun. Surv. Tutorials 10(4), 5–17 (2008)
Kumar, A.: A modified method for solving the unbalanced assignment problems. Appl. Math. Comput. 176(1), 76–82 (2006)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logistics Q. 2(1–2), 83–97 (1955)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Mondal, R.K., Ray, P., Nandi, E., Biswas, B., Sanyal, M.K., Sarddar, D. (2017). Load Balancing of Unbalanced Matrix with Hungarian Method. In: Mandal, J., Dutta, P., Mukhopadhyay, S. (eds) Computational Intelligence, Communications, and Business Analytics. CICBA 2017. Communications in Computer and Information Science, vol 776. Springer, Singapore. https://doi.org/10.1007/978-981-10-6430-2_20
Download citation
DOI: https://doi.org/10.1007/978-981-10-6430-2_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-6429-6
Online ISBN: 978-981-10-6430-2
eBook Packages: Computer ScienceComputer Science (R0)