lkml.org 
[lkml]   [2007]   [Dec]   [5]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH 3/3] Subject: SCHED - Use a 2-d bitmap for searching lowest-pri CPU

* Gregory Haskins <ghaskins@novell.com> wrote:

> However, that said, Steven's testing work on the mainline port of our
> series sums it up very nicely, so I will present that in lieu of
> digging up my -rt numbers unless you specifically want them too. Here
> they are:

i'm well aware of Steve's benchmarking efforts, but i dont think he's
finished with it and i'll let him present the results once he wants to
announce them. I asked about the effects of the "2-d" patch in isolation
and i'm not sure the numbers show that individual patch in action.

in any case, you are preaching to the choir, i wrote the first
rt-overload code and it's been in -rt forever so it's not like you need
to sell me the concept ;-) But upstream quality requirements are
different from -rt and we need to examine all aspects of scheduling, not
just latency. In any case, i'll wait for the rest of Steve's numbers.

Ingo


\
 
 \ /
  Last update: 2007-12-05 12:47    [W:0.570 / U:0.004 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site