The improve of load balancing strategy on Linux system based on EP

Although the Linux2.6 kernel contains a O(1) scheduler, it does not include a certain algorithm to analyze the task's total execution time, which will directly result in certain shortcomings in the computing speed. In order to minimize the task scheduling time of completing load balance, this p...

Full description

Saved in:
Bibliographic Details
Published inProceedings of 2011 International Conference on Computer Science and Network Technology Vol. 3; pp. 1477 - 1480
Main Authors Qiao ShiJiao, Xu Hong, Yuan XingDe
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2011
Subjects
evolutionary programming
Linux
load balancing
Queueing analysis
scheduling algorithm
Online AccessGet full text

Cover

More Information
Summary:Although the Linux2.6 kernel contains a O(1) scheduler, it does not include a certain algorithm to analyze the task's total execution time, which will directly result in certain shortcomings in the computing speed. In order to minimize the task scheduling time of completing load balance, this paper introduced the EP algorithm (Evolutionary Programming) applied in Scheduler. When the system needs to migration process to achieve the load balance, the improved scheduler analyzes the task of busy CPU queue as an entity and then finds out the most optimal distribution solution through the global search ability of EP algorithm, which will eventually achieve the shortest total execution time. The experiment results demonstrate that the enhanced algorithm is more advanced in computing speed.
ISBN:1457715864
9781457715860
DOI:10.1109/ICCSNT.2011.6182245