Advanced

Linux: CFS Group Level Fairness

Posted by Scott_Ruecker on · Post a comment
KernelTrap; By Jeremy Andrews
Mail this story
Print this story

Following a review of Ingo Molnar's Completely Fair Scheduler, Srivatsa Vaddagiri posted a patch allowing the new scheduler to provide fairness at a per-group level rather than at a per-process level. He described the changes that he made and noted,"I have used'uid' as the basis of grouping for timebeing (since that grouping concept is already in mainline today). The patch can be adapted to a moregeneric process grouping mechanism later."Ingo reacted to the patch favorably,"yeah, i like this alot." He went on to comment,"the'struct sched_entity' abstraction looks very clean, and that's the main thing that matters: it allows for a design that will only cost us performance if group scheduling is desired."

Full Story

  Nav
» Read more about: Story Type: Interview; Groups: Linux

» Get new stories by e-mail: nightly or as they are published

« Return to the newswire homepage

  Related stories
» More like this

Comments

No comments yet. Be the first.

Post a comment

A free account is needed to post. Write your comment here first: your text is kept in this browser while you sign up or log in, and is waiting for you when you come back.

Your message:
|||||
10
Markdown: **bold**, *italic*, [text](https://link), - lists, > quotes, $x^2$ for math. Formatting help

Sign up and post (it is free)  or  Log in and post