ArsTechnica Explains O(1) Scheduler

geogeek writes "The recent release of Linux's 2.6 kernel introduces a number sweeping improvements. These can be hard to understand without a background in programming. This week's Linux.ars examines the improved scheduler for an enthusiast audience, concisely explaining its nuances and the practical effects of an O(1) design."

Ars

[GerbilSocks]

I, for one, welcome our new ArsTechnica overlords.

Brought to you by a Squadron of Gay Monkeys.

Linus Didn't steal it from SCO.

[Anonymous Coward]

Please stop posting SCO code here, it only gets Darl all excited.

Sounds like an RPG

[blixel]

When a process uses its timeslice, the scheduler calculates a new timeslice by adding the dynamic priority bonus to the static priority. The process then gets inserted in the second list. When the first list becomes empty, the second list takes the place of the first, and vice-versa. This allows the scheduler to continuously calculate timeslices with minimal computational overhead.

Sounds like the rules to an AD&D adventure.

Re:English 101

[geogeek6_7]

Err. Oops. I blame Soviet Russia.

Interesting

[Anonymous Coward]

1. Post a link to an incomplete, semi-technical, Linux-related article on Slashdot front page
2. Include a Microsoft Windows full page ads in the abovementioned Linux-related article
3. Post comments with links to a somewhat more complete version of said article
4. Get modded up with O(n!) speed for saying "I'm the author of that article"
5. ???
6. Profit!!!