원문정보
초록
영어
Scheduling independent tasks to homogeneous resources is an ineluctable issue to be dealt with. Load balancing of resources is a crucial matter of concern. This paper comes out with an enhancement of hierarchical load balancing algorithm. In this paper, to evaluate cluster imbalance, probability of deviation of average system load from average load of cluster is calculated and checked for confinement within a defined range of 0 to 1. The algorithm also compares the expected computing power of jobs with average computing power of clusters to allocate fittest resources to jobs. In addition to the load balancing and fittest resource allocation, the contribution of our algorithm is twofold. Our algorithm ensures that no cluster remain idle by employing random stealing and random pushing, whereby jobs are taken from other clusters and executed in cluster with empty queue such that the queue length remains within a fixed threshold. The contributions of augmented hierarchical load balancing with intelligence is that it reduces the makespan of algorithm execution together with balancing the overall system load and reduces the idle time of clusters.
목차
1. Introduction
2. Key Concepts
2.1 Clustering
2.2 Job Scheduling
2.3 Load Balancing
2.4 Probability Concepts
3. Related Works
3.1 Dynamic Load Balancing Algorithm
3.2 Most Fit Task First
3.3 Balanced Ant Colony Optimization Algorithm
3.4 Hierarchy Load Balancing Algorithm
3.5 Random Stealing
3.6 Random Pushing
4. Proposed Algorithm
4.1 Enhanced Hierarchical Load Balancing Algorithm
5. Implementation
6. Conclusion and Future Work
References