On Thu, 2009-07-16 at 10:58 +0200, Peter Zijlstra wrote: > Now, let me first state that the current code is a hack, and I know its > nowhere near proper. But it was the best I could come up with on a short > notice -- and Fabio is now looking at doing better :-) > If I can say something (more!) there is quite a lot of work in our lab on this stuff, starting from different perspective and aiming at different goals. I've been involved, and continuing being, on sporadic server implementation, EDF implementation in separate scheduling class (with Michael), while Fabio is doing a lot (and a lot better!) work on deadlines in sched-rt. Independently from what concerns priorities or deadlines, the way the global scheduling is implemented, i.e., with distributed ready queues, raises a lot of issues with the implementation of _global_ _hierarchical_ scheduling policies of both kind, EDF and FP. It is being very hard to figure out, and much more to implement, how things should go when you have push, pull, affinity, and so on! :-( I'll be more precise when I have the code ready, but here the question is, do you think the push and pull approach "is there to stay", or is there room, maybe after trials, errors, experiments and exhaustive search for the correct data structure, to migrate to something that would make global scheduling easier? Dario -- <<This happens because I choose it to happen!>> (Raistlin Majere) ---------------------------------------------------------------------- Dario Faggioli, ReTiS Lab, Scuola Superiore Sant'Anna, Pisa (Italy) http://blog.linux.it/raistlin / raistlin@xxxxxxxxx / dario.faggioli@xxxxxxxxxx
Attachment:
signature.asc
Description: This is a digitally signed message part