[lkml]   [2001]   [Nov]   [26]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH] Scalable page cache

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.)


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:13    [W:0.128 / U:0.684 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site