By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Qiao ShiJiao ; Coll. of Comput. Sci. & Technol., Chengdu Univ. of Inf. Technol., Chengdu, China ; Xu Hong ; Yuan XingDe

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.

Published in:

Computer Science and Network Technology (ICCSNT), 2011 International Conference on  (Volume:3 )

Date of Conference:

24-26 Dec. 2011