On 09/20/2013 07:34 PM, Robert Sanford wrote: > One more point, if you're not doing this already: Allocate 2^N-1 > mbufs, not 2^N. According to the code and comments: "The optimum size > (in terms of memory usage) for a mempool is when n is a power of two > minus one: n = (2^q - 1)." > Many thanks! Didn't know about it.
- [dpdk-dev] How to fight forwarding performance regressio... Dmitry Vyal
- [dpdk-dev] How to fight forwarding performance regr... Robert Sanford
- [dpdk-dev] How to fight forwarding performance ... Venkatesan, Venky
- [dpdk-dev] How to fight forwarding performa... Dmitry Vyal
- [dpdk-dev] How to fight forwarding performance ... Dmitry Vyal
- [dpdk-dev] How to fight forwarding performa... Robert Sanford
- [dpdk-dev] How to fight forwarding performa... Robert Sanford
- [dpdk-dev] How to fight forwarding perf... Dmitry Vyal