Re: Common hash table implementation

Larry McVoy
2001-07-22T16:37:49Z

On Sat, Jul 21, 2001 at 10:25:51PM +0200, Daniel Phillips wrote:
> 1) How random is the hash
> 2) How efficient is it

The hash is not the only part to consider for performance. The rest of the
code is important as well. The code I pointed you to has been really carefully
tuned for performance. And it can be made to be MP safe, SGI did that and
managed to get 455,000 random fetches/second on an 8 way R4400 (each of
these is about the same as the original Pentium at 150Mhz).
--
---
Larry McVoy lm at bitmover.com http://www.bitmover.com/lm