Advertisement

Load Balancing of Unbalanced Matrix with Summation Method

  • Ranjan Kumar Mondal
  • Payel Ray
  • Enakshmi Nandi
  • Biswajit Biswas
  • Manas Kumar Sanyal
  • Debabrata Sarddar
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 701)

Abstract

We know that cloud computing is an online-based servicing. So there are more than a million number of web servers, who are connected to online cloud computing to offer various types of online web services to cloud customers. Limited numbers of web servers connected to the cloud networks have to execute more than a million number of tasks at the same time. So, it is not simple to execute all tasks at a particular moment. Some machines execute all tasks, so there is a need to balance all loads at a time. Load balance minimizes the completion time as well as executes all tasks in a particular way. It is not possible to have an equal number of servers to execute equal tasks. Tasks to be completed in cloud environment system or environment will be greater than the connected components. Hence, a less number of servers have to execute a greater numbers of jobs. We propose a new algorithm in which some machines complete the jobs, where a number of jobs are greater than the number of machines and balance every machine to maximize the excellence of services in the cloud system.

Keywords

Minimum completion time Load balancing Cloud computing 

References

  1. 1.
    Peter, M., Grance, T.: The NIST definition of cloud computing. 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: 03012016Google Scholar
  3. 3.
    Armstrong, R., Hensgen, D., Kidd, T.: The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. In: 7th IEEE Heterogeneous Computing Workshop, pp. 79–87 (1998)Google Scholar
  4. 4.
    Freund, R., Gherrity, M., Ambrosius, S., Campbell, M., Halderman, M., Hensgen, D., Keith, E., Kidd, T., Kussow, M., Lima, J., Mirabile, F., Moore, L., Rust, B., Siegel, H.: Scheduling resources in multi-customer, heterogeneous, computing environments with SmartNet. In: 7th IEEE Heterogeneous Computing Workshop, pp. 184–199 (1998)Google Scholar
  5. 5.
    Ritchie, G., Levine, J.: A fast, effective local search for scheduling independent jobs in heterogeneous computing environments. J. Comput. Appl. 25, 1190–1192 (2005)Google Scholar
  6. 6.
    Braun, T.D., Siegel, H.J., Beck, N., Bölöni, L.L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D., Freund, R.F.: 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
  7. 7.
    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)Google Scholar
  8. 8.
    Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Q. 2(1–2), 83–97 (1955)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Ranjan Kumar Mondal
    • 1
  • 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 KalyaniKolkataIndia
  2. 2.Department of Business AdministrationUniversity of KalyaniKolkataIndia

Personalised recommendations