> It is an interesting data structure, thanks for presenting it.
> But it still has one of the fundamental problems we were trying to
> remove by going to a non-tree mechanism, the balancing cost.
Now that I think of it, is the balancing cost important
in the common case? When we have only 4 to 6 VMAs, we
won't be balancing that much.
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...
Rik.
+-------------------------------------------------------------------+
| Linux memory management tour guide. H.H.vanRiel@phys.uu.nl |
| Scouting Vries cubscout leader. http://www.phys.uu.nl/~riel/ |
+-------------------------------------------------------------------+
-
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/