Re: massive_intr on CFS, BFS, and EDF

[Michael Trimarchi <trimarchi@gandalf.sssup.it>]

Hi,
sat wrote:
> Hi,
>
> I tried massive_intr, a process scheduler's fairness and throughtput testing
> program for massive interactive processes, on vanilla 2.6.31, 2.6.31-bfs211
> (with BFS) and 2.6.31-edf(latest linus tree + EDF patch).
>
> CFS and BFS look good. CFS has better fairness, and BFS has better throughput.
> EDF looks unfair and is unstable. I tested 3 times and the tendency was the
> same.
Thank you for your testing, the instability problems you hit are due to
some bugs in our implementation, we'll try to reproduce and fix them.
Your test shows that we have some problems with how we handle fork();
the code attempts at distributing the bandwidth between the parent and
the child, and the fact that the children hang means that there is
something wrong in how we handle recharges. It is important to note that
the expected behavior of an edf scheduler is *not* a fair one. It has to
do its best to guarantee the deadlines of the admitted tasks.

Regards Michael