Messages in this thread | | | Date | Wed, 26 Feb 2003 18:22:39 +0000 | From | Jamie Lokier <> | Subject | Re: Horrible L2 cache effects from kernel compile |
| |
Andi Kleen wrote: > "John W. M. Stevens" <john@betelgeuse.us> writes: > > > http://www.sourcejudy.com/downloads/10minutes.htm > > 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 majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |