Kernel Space: Fair User Scheduling for Linux | Linux Today

Kernel Space: Fair User Scheduling for Linux

Written By
JC
Jonathan Corbet
Oct 25, 2007

“The Completely Fair Scheduler (CFS) was merged for the 2.6.23
kernel. One CFS feature which did not get in, though, was the group
scheduling facility. Group scheduling makes the CFS fairness
algorithm operate in a hierarchical fashion: processes are divided
into groups, and, within each group, processes are scheduled fairly
against one another. At the higher level, each group as a whole is
given a fair share of the processor. The grouping of processes is
done in user space in a highly flexible manner; the control groups
(formerly ‘process containers’) mechanism allows a management
daemon to classify processes according to almost any policy…”

Complete
Story

JC

Jonathan Corbet

Linux Today Logo

LinuxToday is a trusted, contributor-driven news resource supporting all types of Linux users. Our thriving international community engages with us through social media and frequent content contributions aimed at solving problems ranging from personal computing to enterprise-level IT operations. LinuxToday serves as a home for a community that struggles to find comparable information elsewhere on the web.

Property of TechnologyAdvice. © 2026 TechnologyAdvice. All Rights Reserved

Advertiser Disclosure: Some of the products that appear on this site are from companies from which TechnologyAdvice receives compensation. This compensation may impact how and where products appear on this site including, for example, the order in which they appear. TechnologyAdvice does not include all companies or all types of products available in the marketplace.