Load Balancing of Unbalanced Matrix Problem with More Machines

  • Ranjan Kumar MondalEmail author
  • Payel Ray
  • Enakshmi Nandi
  • Biswajit Biswas
  • Manas Kumar Sanyal
  • Debabrata Sarddar
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 836)


In nowadays cloud computing as a developing web accommodation model has been propagating to offer different Internet resources to users. Cloud computing occupies a range of computing Internet applications for facilitating the finishing of sizable voluminous-scale tasks. Cloud computing is a web predicated distributed computing. There is more than a million number of servers connected to the Internet to provide several types of accommodations to provide cloud users. Constrained numbers of servers execute fewer numbers tasks at a time. So it is not too easy to execute all tasks at a time. Some systems execute all tasks, so there are needed to balance all loads. Load balance minimizes the completion time as well as executes all tasks a particular way.

There are not possible to remain equal number servers to execute equal tasks. Tasks to be executed in cloud computing would be less than the connected servers sometime. Excess servers have to execute a fewer number of tasks. Here we are going to present an algorithm for load balancing and performance with minimization completion time and throughput. We apply here a very famous Hungarian method to balance all loads in distributing computing. Hungarian Technique helps us to minimize the cost matrix problem.


Load balancing Load balancing algorithms Cloud computing Hungarian method 


  1. 1.
    Mell, P., Grance, T.: The NIST definition of cloud computing, pp. 20–23 (2011)Google Scholar
  2. 2.
    Mondal, R.K., Ray, P., Sarddar, D.: Load balancing. Int. J. Res. Comput. Appl. Inf. Technol. 4(1), 01–21 (2016). ISSN Online: 2347-5099, Print: 2348-0009, DOA: 03012016MathSciNetGoogle Scholar
  3. 3.
    Ritchie, G., Levine, J.: A fast, effective local search for scheduling independent works in heterogeneous computing environments. J. Comput. Appl. 25, 1190–1192 (2005)Google Scholar
  4. 4.
    Braun, T.D., et al.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput. 61, 810–837 (2001)CrossRefGoogle Scholar
  5. 5.
    Wang, S.C., Yan, K.Q., Liao, W.P., Wang, S.S.: Towards a load balancing in a three-level cloud computing network. In: CSIT, pp. 108—113 (2010)Google Scholar
  6. 6.
    Hung, C.-L., Wang, H.-H., Hu, Y.-C.: Efficient load balancing algorithm for cloud computing network. In: International Conference on Information Science and Technology (IST 2012), pp. 28–30, April 2012Google Scholar
  7. 7.
    Kokilavani, T., Amalarethinam, D.G.: Load balanced min-min algorithm for static meta-task scheduling in grid computing. Int. J. Comput. Appl. 20(2), 43–49 (2011)Google Scholar
  8. 8.
    Wu, M.-Y., Shu, W., Zhang, H.: Segmented min-min: a static mapping algorithm for meta-tasks on heterogeneous computing systems. In: Proceedings of the 9th Heterogeneous Computing Workshop (HCW 2000), pp. 375–385. IEEE (2000)Google Scholar
  9. 9.
    Mondal, R.K., et al.: Load balancing with job switching in cloud computing network. In: Satapathy, S.C., Bhateja, V., Udgata, S.K., Pattnaik, P.K. (eds.) Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications. AISC, vol. 516, pp. 305–312. Springer, Singapore (2017). Scholar
  10. 10.
    Mondal, R.K., Ray, P., Nandi, E., Biswas, B., Sanyal, M.K., Sarddar, D.: Load balancing of unbalanced matrix with hungarian method. In: Mandal, J.K., Dutta, P., Mukhopadhyay, S. (eds.) CICBA 2017. CCIS, vol. 776, pp. 256–270. Springer, Singapore (2017). Scholar
  11. 11.
    Mondal, R.K., Ray, P., Nandi, E., Sen, P., Sarddar, D.: Load balancing of the unbalanced cost matrix in a cloud computing network. In: Computer, Communication and Electrical Technology: Proceedings of the International Conference on Advancement of Computer Communication and Electrical Technology (ACCET 2016), West Bengal, India, 21–22 October 2016, p. 81. CRC Press (2017)Google Scholar
  12. 12.
    Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. (NRL) 2(1–2), 83–97 (1955)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Ranjan Kumar Mondal
    • 1
    Email author
  • Payel Ray
    • 1
  • Enakshmi Nandi
    • 1
  • Biswajit Biswas
    • 2
  • Manas Kumar Sanyal
    • 2
  • Debabrata Sarddar
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of KalyaniKalyaniIndia
  2. 2.Department of Business AdministrationUniversity of KalyaniKalyaniIndia

Personalised recommendations