A Greedy Algorithm for Load Balancing Jobs with Deadlines in a Distributed Network
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 2
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.
Authors and Affiliations
Ciprian Paduraru
Keywords
Related Articles
- EP ID EP115786
- DOI 10.14569/IJACSA.2014.050209
- Views 124
- Downloads 0
A fast cryptosystem using reversible cellular automata
This article defines a new algorithm for a secret key cryptosystem using cellular automata which is a promising approach to cryptography. Our algorithm is based on cellular automata built on a set of reversible rules whi...
Video Watermarking System for Copyright Protection based on Moving Parts and Silence Deletion
In recent years, video watermarking has emerged as a powerful technique for ensuring copyright protection. However, ensuring the lowest level of distortion, high transparency and transparency control, integrity of the wa...
Analysis of Child Computer Interaction in Edutainment and Simulation Games Application on Android Platform in Indonesia
Child Computer Interaction (CCI) has become a challenge in utilizing the technology as education media. The increasing number of children, who use advanced gadgets in Indonesia such as smartphones and tablet PCs, provide...
Global Citation Impact rather than Citation Count
The progressing bloom in the tome of scientific literature available today debars researchers from efficiently shrewd the relevant from irrelevant content. Researchers are persistently engrossed in impactful papers, auth...
MINING POSITIVE AND NEGATIVE ASSOCIATION RULES USING FII-TREE
Positive and negative association rules are important to find useful information hidden in large datasets, especially negative association rules can reflect mutually exclusive correlation among items. Association rule mi...