Date: Mon, 3 Mar 1997 21:19:39 -0500 (EST) From: Ken Wong <wong@a17b32.rogerswave.ca> To: Alan Cox <alan@cymru.net> Cc: davem@jenolan.rutgers.edu, imb@scgt.oz.au, dg@root.com, netdev@roxanne.nuclecu.unam.mx, hackers@freebsd.org Subject: Re: ok, final sockhash changes, new diff Message-ID: <Pine.BSF.3.91.970303210747.301A-100000@wong.rogerswave.ca> In-Reply-To: <199703022238.WAA23129@snowcrash.cymru.net>
next in thread | previous in thread | raw e-mail | index | archive | help
On Sun, 2 Mar 1997, Alan Cox wrote: > I talked to a few dynamic "perfect has" folks a while ago. They all said > overhead of recomputation of the hash was too high. actually, this paper by Larson talks about the hash table with n items in each packet. when the packet axceed n items, it double its table size. Note that in most app, growth shouldn't happen often. however, if overhead is the problem, you can modify the algo a little to search said item k, if the design item is not in k, then search k/2 (asume that you know that to grow the table is doubling the table size). and if found re-insert it in k... Ken
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?Pine.BSF.3.91.970303210747.301A-100000>