Hi,
I have gotten clearer idea of fairness between processes. Thanks for
your explanation with enough patience. :-)
2011/9/20 Mulyadi Santosa mulyadi.sant...@gmail.com:
Hi .
I am reaching my virtual limit here, so beg me pardon :)
On Mon, Sep 19, 2011 at 23:26, Parmenides
Hmm..., does
Hi Permenides :)
On Tue, Sep 20, 2011 at 18:11, Parmenides mobile.parmeni...@gmail.com wrote:
Hi,
I have gotten clearer idea of fairness between processes. Thanks for
your explanation with enough patience. :-)
Looks like I made few typos here and there, so allow me to put few erratas :)
2011/9/21 Mulyadi Santosa mulyadi.sant...@gmail.com:
Hi Permenides :)
Looks like I made few typos here and there, so allow me to put few erratas :)
2011/9/20 Mulyadi Santosa mulyadi.sant...@gmail.com:
What the scheduler needs perhaps at this point is good priority
recalculation is C could
Hi,
2011/9/19 Mulyadi Santosa mulyadi.sant...@gmail.com:
Hi :)
Seriously, what I consider more fair is Con Kolivas BFS scheduler
these days. No excessive time slice weighting, just priority
stepping and very strict deadline.
Hmm..., does that mean timeslice weighting introduce unfainess?
Hi .
I am reaching my virtual limit here, so beg me pardon :)
On Mon, Sep 19, 2011 at 23:26, Parmenides
Hmm..., does that mean timeslice weighting introduce unfainess? If we
think fairness relies on each task not fetching more timeslice than
other tasks, the eaiest way to achieve fairness
Hi...
This would take us back to the days of comp science bachelor seat :)
On Sun, Sep 18, 2011 at 01:29, Parmenides mobile.parmeni...@gmail.com wrote:
Hi,
Current kernel 2.6 have adopted the CFS scheduler which try to
ensure that all process can obtain their proportions of allotted
