Hi, this is a simple question... anyone working on integrating fairsched
with O(1) ?

I would like to try doing it, but I think it's better if I share
the work with others who are trying to do it.

For those that donĂ't know, "fairsched"distributes evenly the CPU amongst
different users competing for it. Thus, on a non-fairsched kernel user A
running 4 CPU-hogs will get four times as much CPU as user B which
runs only 1 CPU-hog.

fairsched works by keeping stats of per-user CPU time and tries to balance
it so that no user can get all CPU.

I'm just starting to review the 2.4.19 implementation, which is based on
the classic O(n) scheduler, so any help on forward porting it to 2.5.66+
will be apreciated.


Greets, Antonio.