lkml.org 
[lkml]   [2001]   [Dec]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
    /
    SubjectRe: [RFC] Scheduler queue implementation ...
    Date
    From
    > So we can have simply two queues ( per CPU ), one that stores I/O bound (
    > counter > K for example ) and RT tasks that is walked entirely searching
    > for the better tasks, the other queue will store CPU bound tasks that are
    > executed in a FIFO policy.

    Oh as an aside btw - there are many real world workloads where we have a lot
    of non cpu hog processes running. A lot of messaging systems have high task
    switch rates but very few cpu hogs. So you still need to handle the non hogs
    carefully to avoid degenerating back into Linus scheduler.
    -
    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: 2005-03-22 13:14    [W:2.621 / U:0.064 seconds]
    ©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site