Messages in this thread | | | Date | Fri, 05 Jun 2009 08:21:43 +0300 | From | Avi Kivity <> | Subject | Re: [RFC] CPU hard limits |
| |
Balbir Singh wrote: >> But then there is no other way to make a *guarantee*, guarantees come >> at a cost of idling resources, no? Can you show me any other >> combination that will provide the guarantee and without idling the >> system for the specified guarantees? >> > > OK, I see part of your concern, but I think we could do some > optimizations during design. For example if all groups have reached > their hard-limit and the system is idle, should we do start a new hard > limit interval and restart, so that idleness can be removed. Would > that be an acceptable design point?
I think so. Given guarantees G1..Gn (0 <= Gi <= 1; sum(Gi) <= 1), and a cpu hog running in each group, how would the algorithm divide resources?
-- I have a truly marvellous patch that fixes the bug which this signature is too narrow to contain.
| |