lkml.org 
[lkml]   [2014]   [Sep]   [10]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
From
SubjectScheduler algorithm
Date
Hi all,
I have a doubt to clarify.

any scheduler class manage the "pick_next_task" internally (e.g.: CFS use a red-black tree and the "fair" algorithm, etc). 
The main scheduler just:

class = sched_class_highest;

for ( ; ; ) {

   p = class->pick_next_task(rq);

      if (p)

         return p;

/// ...


my question is from the "big picture" point of view:
when the scheduler ask for a new task as to the "highest class" first (RR/FIFO policy) and then stepping to the  next one (CFS). 
But, doesn't this treat the CFS process at the same level of the real time process? 
I mean the scheduler ask first to the rt_sched_class and then fair_sched_class ... in a for ... 

can you clarify, please where the "real time" task are different?
thanks in advance!

I'd like to be in cc'ed on this.

Kasper. --
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2014-09-10 13:01    [W:0.038 / U:0.444 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site