Messages in this thread | | | Date | Fri, 15 Sep 2006 15:15:45 +0400 | From | Pavel Emelianov <> | Subject | Re: [ckrm-tech] [PATCH] BC: resource beancounters (v4) (added user memory) |
| |
Kirill Korotaev wrote:
[snip] >> I have a C program that computes limits to obtain desired guarantees >> in a single 'for (i = 0; i < n; n++)' loop for any given set of guarantees. >> With all error handling, beautifull output, nice formatting etc it weights >> only 60 lines.
Look at http://wiki.openvz.org/Containers/Guarantees_for_resources I've described there how a guarantee can be get with limiting in details.
[snip]
>> I do not 'do not like guarantee'. I'm just sure that there are two ways >> for providing guarantee (for unreclaimable resorces): >> 1. reserving resource for group in advance >> 2. limit resource for others >> Reserving is worse as it is essentially limiting (you cut off 100Mb from >> 1Gb RAM thus limiting the other groups by 900Mb RAM), but this limiting >> is too strict - you _have_ to reserve less than RAM size. Limiting in >> run-time is more flexible (you may create an overcommited BC if you >> want to) and leads to the same result - guarantee. > I think this deserves putting on Wiki. > It is very good clear point.
This is also on the page I gave link at. - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |