| >NEW: Info to the keyword RoundRobin | >discuss | >create link |
on Mar 22nd 2004, 16:49:09, elfboi wrote the following aboutRoundRobin |
|
A simple round robin scheduler has a computing time cost of O(n), where n is the number of processes. The new scheduler of the Linux 2.6 kernel has a O(1) scheduler, meaning that the scheduler always uses the same amount of computing time, no matter how many processes it has to manage. |
| user rating: +3 |
|
Make this world a better place and enter what you think about »RoundRobin« into the Assoziations-Blaster's database. |
| Configuration | Web-Blaster | Statistics | »RoundRobin« | FAQ | Home Page |  |
| 0.0014 (0.0006, 0.0001) sek. –– 82981718 | |