By Topic

Performance evaluation of completely fair schedule for multicore processor system

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

2 Author(s)
Hao Cao ; Coll. of Comput. Sci., Inner Mongolia Univ., Huhhot, China ; Liqiang He

Completely Fair Schedule (CFS) is a main scheduling algorithm in nowadays Linux based system. For a multicore computer system, the CFS boosts the performance through load balance among the running tasks. In this paper, we analysis the implementation of the CFS scheduler in Linux environment, and then do experiments to evaluate the performance of CFS for multicore system. The experimental results show that the CFS successfully does the task scheduling for multiple tasks and obtains a good load balance at the same time.

Published in:

Electrical and Control Engineering (ICECE), 2011 International Conference on

Date of Conference:

16-18 Sept. 2011