Skip to main content

Efficient Load Balancing in Distributed Computing Environments with Enhanced User Priority Modeling

  • Conference paper
  • First Online:
Smart Computing Techniques and Applications

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 225))

  • 591 Accesses

Abstract

In the distributed computing environments, user-submitted job details such as the expected job completion time estimates are prone to inaccuracies. These inaccurate details force the system to under-perform due to ineffective allocation of processing resources. Addressing the concerns that crop-up due to the presence of these ill-defined user-provided parameters is an important task, which is very much required to get the jobs executed using optimal number of resources. At the same time, studying the ways of deriving accurate job runtimes benefits us in attaining improved load balancing results. The work proposed in the present study tries to apply an enhanced user priority model, taking into account the penalty and aging of job requests. It also combines least load variance method to improve the load balancing across grid resources. Simulation results obtained using realistic workloads bring forward the load balance efficiency of the studied scheme. This also confirms that to consider and infer of improved modeling of these user priority provides gains that outperform the methods void of it. The results attained are equated and contrasted with prevailing algorithms in terms of parameters like response time, wait time, tardiness, and average resource utilization in high-performance computing environments.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Rice, M.: 14 High Performance Computing Applications & Examples. https://builtin.com/hardware/high-performance-computing-applications/. Accessed 19 June 2020

  2. Balis, B., et al.: Porting HPC applications to the cloud: a multi-frontal solver case study. J. Comput. Sci. 18, 106–116 (2017)

    Google Scholar 

  3. Rocchetti, N., Iturriaga, S., Nesmachnow, S.: Including accurate user estimates in HPC schedulers: ban empirical analysis. In: XXI CongresoArgentino de Ciencias de la Computación (Junín, 2015) 2015

    Google Scholar 

  4. Rocchetti, N., et al.: Penalty scheduling policy applying user estimates and aging for supercomputing centers. In: Latin American High-Performance Computing Conference. Springer, Cham (2016)

    Google Scholar 

  5. Emeras, J., et al.: Evalix: classification and prediction of job resource consumption on HPC platforms. In: Job Scheduling Strategies for Parallel Processing. Springer, Cham (2015)

    Google Scholar 

  6. Galleguillos, C., et al.: Constraint programming-based job dispatching for modern HPC applications. In: International Conference on Principles and Practice of Constraint Programming. Springer, Cham (2019)

    Google Scholar 

  7. Zotkin, D., Keleher, P.J.: Job-length estimation and performance in backfilling schedulers. In: 8th International Symposium on High Performance Distributed Computing, pp. 236–243 (1999)

    Google Scholar 

  8. Buyya, R., Murshed, M.: Gridsim: A toolkit for the modeling and simulation of distributedresource management and scheduling for grid computing. Concurr. Comput. Pract. Exp. 14(13–15), 1175–1220 (2002)

    Article  Google Scholar 

  9. Klusáček, D., Tóth, Š., Podolníková, G.: Complex job scheduling simulations with Alea 4. In: Proceedings of the 9th EAI International Conference on Simulation Tools and Techniques (2016)

    Google Scholar 

  10. ULHPC: The gaia cluster hpc at university of luxemburg. https://hpc.uni.lu/systems/gaia/. Accessed 26 March 2020

  11. Thakor, D., Patel, B.: P2s_dlb: pluggable to scheduler dynamic load balancing algorithm for distributed computing environment. In: Emerging Trends in Expert Applications and Security, pp. 347–355. Springer, Singapore (2019)

    Google Scholar 

  12. Guim, F., Corbaĺan, J., Labarta, J.: Prediction f-based models for evaluating backfilling scheduling policies. In: 8th IEEE International Conference on Parallel and Distributed Computing, Applications & Technologies, pp. 9–17 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hijab, M., Damodaram, A. (2021). Efficient Load Balancing in Distributed Computing Environments with Enhanced User Priority Modeling. In: Satapathy, S.C., Bhateja, V., Favorskaya, M.N., Adilakshmi, T. (eds) Smart Computing Techniques and Applications. Smart Innovation, Systems and Technologies, vol 225. Springer, Singapore. https://doi.org/10.1007/978-981-16-0878-0_70

Download citation

Publish with us

Policies and ethics