Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network

Author 1: Ciprian I. Paduraru
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 5, No. 2 · Published 2014

DOI: https://doi.org/10.14569/IJACSA.2014.050209

Abstract

One of the most challenging issues when dealing with distributed networks is the efficiency of jobs load balancing. This paper presents a novel algorithm for load balancing jobs that have a given deadline in a distributed network assuming central coordination. The algorithm uses a greedy strategy for global and local decision making: schedule a job as late as possible. It has an increased overhead over other well-known methods, but the load balancing policy provides a better fit for jobs.

Keywords

How to Cite this Article

Paduraru, C. I. (2014). A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network. International Journal of Advanced Computer Science and Applications, 5(2). https://doi.org/10.14569/IJACSA.2014.050209

Paduraru, Ciprian I.. "A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network." International Journal of Advanced Computer Science and Applications, vol. 5, no. 2, 2014, https://doi.org/10.14569/IJACSA.2014.050209.

@article{Paduraru2014,
  title     = {A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {5},
  number    = {2},
  year      = {2014},
  publisher = {The Science and Information Organization},
  author    = {Ciprian I. Paduraru},
  doi       = {10.14569/IJACSA.2014.050209},
  url       = {https://doi.org/10.14569/IJACSA.2014.050209}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.