[lkml]   [2003]   [Feb]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: Horrible L2 cache effects from kernel compile
Andi Kleen wrote:
> "John W. M. Stevens" <> writes:
> >
> Feel free to code it up. If you did I'm sure someone would be willing
> to test it on large boxes too.
> However with RCU in the equation looking may get very interesting...
> Hash tables have the advantage that they're simply enough for lockless
> tricks; balanced trees are likely not so lucky.
> -Andi (who took a look at judy some time ago but it looked horribly
> complicated, even worse so than skiplists)

Note that the Judy trees paper has some text deleted which begins
"{some Judy patent applications}... {Remainder deleted, sorry, you
don't need to read this to understand the released software.}".

Maybe some parts of the algorithm are patent-pending in the US?

-- Jamie
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:33    [W:0.061 / U:16.032 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site