Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2014.050209
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 5 Issue 2, 2014.
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