Advanced

Linux: Understanding the Completely Fair Scheduler

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

"As I understand, fair_clock is a monotonously increasing clock which advances at a pace inversely proportional to the load on the run queue," Srivatsa Vaddagiri explained in a review of Ingo Molnar's CFS CPU scheduler, "if load = 1 (task), it will advance at same pace as wall clock, as load increases it advances slower than wall clock."

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