On Mon, 17 Apr 2017 15:47:59 +0000 "Fu, Qiaobin" <[email protected]> wrote:
> Hello, > > Currently, I am using the hash library to handle network flows defined as > source and destination IP addresses. I need to find a way to alleviate memory > pressure when the table is full. However, after some research, I didn’t find > any hints on the dynamic growth in the hash library. Could anyone point me > some hints on this? Thanks. > > Best, > Qiaobin If you need growing hash table, I recommend the lock-free hash table in the Linux userspace RCU library; rather than the more limited DPDK one.
