> And when we have hundreds of VMAs, doesn't the lookup
> cost completely dwarf the balancing cost? The benchmarks
> we've seen the last few weeks seem to suggest so...
>
> Research work shows that only at around 1000 entires does the lookup
> speed make up for the balancing cost of a tree.
Was this research done for the Linux VMA case or for some "average" access
patterns used by the database folks? The latter would be of little use since
in most cases we have more finds than inserts/deletes (*much* more on a i386
where we need it for access_ok()).
Have a nice fortnight
-- Martin `MJ' Mares <mj@ucw.cz> http://atrey.karlin.mff.cuni.cz/~mj/ Faculty of Math and Physics, Charles University, Prague, Czech Rep., Earth "What? DosShell wasn't supposed to be a joke?"- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/