Andi Kleen writes:
> The reason I'm asking is that we still have trouble with the TCP hash tables
> taking far too much memory, and your new data structure might provide a nice
> alternative.
Yes it's dynamic and selftuning so no need reserve memory in advance and still
comparable perfor
On Monday 04 September 2006 14:53, Robert Olsson wrote:
> No we haven't put struct socket in the leafs (result node) yet we just kept
> dst entries and some stateful flow variables that we used for active GC
> and flow logging so far. So 128 bit flow version of the dst hash. It would
> have
Andi Kleen writes:
> On Monday 04 September 2006 13:43, Robert Olsson wrote:
> >
> > Hello.
> >
> > People on this list might find this paper interesting:
> > http://www.csc.kth.se/~snilsson/public/papers/trash/
>
> Looks nice. Have you looked at using it for local TCP/UDP socket
> loo
On Monday 04 September 2006 13:43, Robert Olsson wrote:
>
> Hello.
>
> People on this list might find this paper interesting:
> http://www.csc.kth.se/~snilsson/public/papers/trash/
Looks nice. Have you looked at using it for local TCP/UDP socket
lookups too or would that be part of the "unified
Hello.
People on this list might find this paper interesting:
http://www.csc.kth.se/~snilsson/public/papers/trash/
Abstract is below. Feel free to redistribute.
Cheers.
--ro
TRASH - A dynamic LC-trie and hash data structure
Robert Olsson and Stefan Nil
