. "16342672"^^ . "Completely Fair Scheduler (zkracov\u00E1no CFS, \u010Desky doslova Zcela f\u00E9rov\u00FD pl\u00E1nova\u010D) je jeden z pl\u00E1nova\u010D\u016F linuxov\u00E9ho j\u00E1dra, do kter\u00E9ho je za\u010Dlen\u011Bn od verze 2.6.23 vydan\u00E9 v \u0159\u00EDjnu 2007. Naprogramoval jej Ingo Moln\u00E1r a inspiroval se p\u0159itom u konkuren\u010Dn\u00EDho pl\u00E1nova\u010De Cona Kolivase. Na rozd\u00EDl od star\u0161\u00EDch pl\u00E1nova\u010D\u016F, kter\u00E9 m\u011Bly fronty \u00FAloh, spravuje CFS v\u0161echny procesy v jedin\u00E9m \u010Derveno-\u010Dern\u00E9m strom\u011B. Frekvenci p\u0159ep\u00EDn\u00E1n\u00ED lze nastavit na \u00FArovni nanosekund a t\u00EDm ovlivnit, zda je d\u016Fle\u017Eit\u011Bj\u0161\u00ED, aby syst\u00E9m rychle reagoval (typicky u stoln\u00EDch po\u010D\u00EDta\u010D\u016F), nebo aby m\u011Bl celkov\u011B co nejvy\u0161\u0161\u00ED v\u00FDkon (typicky u server\u016F).Asymptotick\u00E1 \u010Dasov\u00E1 slo\u017Eitost pl\u00E1novac\u00EDho algoritmu je O(log N), p\u0159i\u010Dem\u017E samotn\u00E9 napl\u00E1nov\u00E1n\u00ED sice prob\u00EDh\u00E1 v konstantn\u00EDm \u010Dase, ale znovuza\u0159azen\u00ED procesu do \u010Derveno-\u010Dern\u00E9ho stromu vy\u017Eaduje O(log N) operac\u00ED."@cs . "624686"^^ . . . "10"^^ . . . . "2209"^^ . . . . . "Completely Fair Scheduler (zkracov\u00E1no CFS, \u010Desky doslova Zcela f\u00E9rov\u00FD pl\u00E1nova\u010D) je jeden z pl\u00E1nova\u010D\u016F linuxov\u00E9ho j\u00E1dra, do kter\u00E9ho je za\u010Dlen\u011Bn od verze 2.6.23 vydan\u00E9 v \u0159\u00EDjnu 2007. Naprogramoval jej Ingo Moln\u00E1r a inspiroval se p\u0159itom u konkuren\u010Dn\u00EDho pl\u00E1nova\u010De Cona Kolivase. Na rozd\u00EDl od star\u0161\u00EDch pl\u00E1nova\u010D\u016F, kter\u00E9 m\u011Bly fronty \u00FAloh, spravuje CFS v\u0161echny procesy v jedin\u00E9m \u010Derveno-\u010Dern\u00E9m strom\u011B."@cs . "Completely Fair Scheduler"@cs . . . . . . "Completely Fair Scheduler"@cs .