* re: The 10ms averager in fair.c
@ 2012-09-30 12:16 Uwaysi Bin Kareem
0 siblings, 0 replies; 9+ messages in thread
From: Uwaysi Bin Kareem @ 2012-09-30 12:16 UTC (permalink / raw)
To: linux-kernel
I also did a quick hack changing some of those values, giving
non-interrputed audiostream with audioapp alone, at 0.7ms. (on a core2duo
@ 2.5ghz)
That is actually better than BFS.
Peace Be With You.
^ permalink raw reply [flat|nested] 9+ messages in thread
* The 10ms averager in fair.c
@ 2012-09-30 11:44 Uwaysi Bin Kareem
2012-09-30 19:18 ` Uwaysi Bin Kareem
[not found] ` <1349064397.6957.26.camel@marge.simpson.net>
0 siblings, 2 replies; 9+ messages in thread
From: Uwaysi Bin Kareem @ 2012-09-30 11:44 UTC (permalink / raw)
To: linux-kernel
Hiya. I just had an initial look at fair.c
There seems to be a 10ms averager in there?
You are aware that that means you work on delayed values?
Isn`t that counterintuitive to the principle of sharing?
That means short bursts of cpu-use will be filtered out, and given less
cpu time.
Starting applications won`t have their cpu-usage before 5ms, which is
quite a bit on modern machines. Well if you use a linearphase filter, I
don`t know what kind of averager you use. The best would ofcourse be to
use a minimalphase gaussian averager. Which might be overkill. Atleast a
one-pole iir, buf = buf + (-buf + in) * cut)); One pole IIRs also have a
better frequency response.
When you are working with low-latencies, wouldn`t it be better if such
things are tuned for target latency. I think few care about latency after
0.2ms. So say the filter should be set to 0.4ms max.
Why would you want to filter cpu-usage also really?
Peace Be With You.
(please CC me.)
^ permalink raw reply [flat|nested] 9+ messages in thread* Re: The 10ms averager in fair.c
2012-09-30 11:44 Uwaysi Bin Kareem
@ 2012-09-30 19:18 ` Uwaysi Bin Kareem
[not found] ` <1349064397.6957.26.camel@marge.simpson.net>
1 sibling, 0 replies; 9+ messages in thread
From: Uwaysi Bin Kareem @ 2012-09-30 19:18 UTC (permalink / raw)
To: linux-kernel
Just to illustrate, you have a filter that lasts 10ms, and a cpu process
that lasts 100uS
Original spike
5 |
4 |
3 |
2 |
1 |
0 |
0ms_______________________10ms
Filtered spike
5
4
3
2
1 .....................
0.. ..
0ms________________________10ms
Not only is the filtered spike, much lower, but it lasts long beyond the
100uS spike. (10ms). Why would that be used in something that should
represent cpu-usage?
Peace Be With You.
On Sun, 30 Sep 2012 13:44:14 +0200, Uwaysi Bin Kareem
<uwaysi.bin.kareem@paradoxuncreated.com> wrote:
> Hiya. I just had an initial look at fair.c
>
> There seems to be a 10ms averager in there?
>
> You are aware that that means you work on delayed values?
>
> Isn`t that counterintuitive to the principle of sharing?
>
> That means short bursts of cpu-use will be filtered out, and given less
> cpu time.
> Starting applications won`t have their cpu-usage before 5ms, which is
> quite a bit on modern machines. Well if you use a linearphase filter, I
> don`t know what kind of averager you use. The best would ofcourse be to
> use a minimalphase gaussian averager. Which might be overkill. Atleast a
> one-pole iir, buf = buf + (-buf + in) * cut)); One pole IIRs also have a
> better frequency response.
>
> When you are working with low-latencies, wouldn`t it be better if such
> things are tuned for target latency. I think few care about latency
> after 0.2ms. So say the filter should be set to 0.4ms max.
>
> Why would you want to filter cpu-usage also really?
>
> Peace Be With You.
>
> (please CC me.)
^ permalink raw reply [flat|nested] 9+ messages in thread[parent not found: <1349064397.6957.26.camel@marge.simpson.net>]
* Re: The 10ms averager in fair.c
[not found] ` <1349064397.6957.26.camel@marge.simpson.net>
@ 2012-10-01 13:24 ` Uwaysi Bin Kareem
[not found] ` <1349146202.7086.23.camel@marge.simpson.net>
2012-10-02 6:56 ` Uwaysi Bin Kareem
1 sibling, 1 reply; 9+ messages in thread
From: Uwaysi Bin Kareem @ 2012-10-01 13:24 UTC (permalink / raw)
To: Mike Galbraith
On Mon, 01 Oct 2012 06:06:37 +0200, Mike Galbraith <efault@gmx.de> wrote:
> On Sun, 2012-09-30 at 13:44 +0200, Uwaysi Bin Kareem wrote:
>> Hiya. I just had an initial look at fair.c
>>
>> There seems to be a 10ms averager in there?
>>
>> You are aware that that means you work on delayed values?
>>
>> Isn`t that counterintuitive to the principle of sharing?
>
> Not if you want to be able to use lots of groups, and still do something
> other than in-kernel arithmetic.
>
> -Mike
>
"Use lots of groups"? I don`t even see the point with that. Currently
doesn`t cfs manipulate nice levels? If you set constant nice levels, and
remove the filter, things will work more as expected. High nice value,
should be short slice. That is your "group", for instance "low priority
stuff".
That a filter filters out the initial cpu spike, only to starve it and
elevate the priority later, is silly. That is delayed execution.
Now I haven`t looked that close at the whole scheduler yet, but no.. I
can`t possibly think what a filter does in there, that smears at 100uS
spike, over 10ms.
Btw, I did set it to 1ns, and it only improved things. So that it should
have some function seems odd to me.
Are you sure this isn`t just a design-philosophy that was done, without
much knowledge of filters?
Peace Be With You.
^ permalink raw reply [flat|nested] 9+ messages in thread* Re: The 10ms averager in fair.c
[not found] ` <1349064397.6957.26.camel@marge.simpson.net>
2012-10-01 13:24 ` Uwaysi Bin Kareem
@ 2012-10-02 6:56 ` Uwaysi Bin Kareem
[not found] ` <1349169555.7086.48.camel@marge.simpson.net>
1 sibling, 1 reply; 9+ messages in thread
From: Uwaysi Bin Kareem @ 2012-10-02 6:56 UTC (permalink / raw)
To: Mike Galbraith
This is just too much code for me to do a quick patch on. It really needs
to be evaulated with concerns to what an optimal scheduler is. That would
be to operate on actual system load ofcourse, not a filtered system load
that doesn`t represent what is actually happening on a computer.
What you can do for the time being is just set it to 1nS. If that doesn`t
negatively impact anything, then you know it is bogus.
Peace Be With You.
^ permalink raw reply [flat|nested] 9+ messages in thread
end of thread, other threads:[~2012-10-05 19:54 UTC | newest]
Thread overview: 9+ messages (download: mbox.gz follow: Atom feed
-- links below jump to the message on this page --
2012-09-30 12:16 The 10ms averager in fair.c Uwaysi Bin Kareem
-- strict thread matches above, loose matches on Subject: below --
2012-09-30 11:44 Uwaysi Bin Kareem
2012-09-30 19:18 ` Uwaysi Bin Kareem
[not found] ` <1349064397.6957.26.camel@marge.simpson.net>
2012-10-01 13:24 ` Uwaysi Bin Kareem
[not found] ` <1349146202.7086.23.camel@marge.simpson.net>
2012-10-02 7:04 ` Uwaysi Bin Kareem
2012-10-05 19:54 ` Uwaysi Bin Kareem
2012-10-02 6:56 ` Uwaysi Bin Kareem
[not found] ` <1349169555.7086.48.camel@marge.simpson.net>
2012-10-02 8:07 ` Uwaysi Bin Kareem
[not found] ` <1349176973.7086.96.camel@marge.simpson.net>
2012-10-02 9:28 ` Uwaysi Bin Kareem
This is an external index of several public inboxes,
see mirroring instructions on how to clone and mirror
all data and code used by this external index.