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.

Ciprian I. Paduraru, “A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network” International Journal of Advanced Computer Science and Applications(IJACSA), 5(2), 2014. http://dx.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}
doi = {10.14569/IJACSA.2014.050209},
url = {http://dx.doi.org/10.14569/IJACSA.2014.050209},
year = {2014},
publisher = {The Science and Information Organization},
volume = {5},
number = {2},
author = {Ciprian I. Paduraru},
}