there is a case where the binary tree has less cache footprint than the
hash - when big continuous areas of files are cached, *and* the access
patterns are linear. In this case the binary tree uses only the continuous
mem_map[] area for its data structures - while the hash uses the hash
table as well. (which is +12% or +25%, in the stock/buckets variant.)
Ingo
-
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/
This archive was generated by hypermail 2b29 : Fri Nov 30 2001 - 21:00:22 EST