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 tasks 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.
Linux scheduling algorithm load balancing evolutionary programming
Qiao ShiJiao Xu Hong Yuan XingDe
College of Computer Science & Technology, Chengdu University of Information Technology Chengdu China
国际会议
哈尔滨
英文
1477-1480
2011-12-24(万方平台首次上网日期,不代表论文的发表时间)