[lkml]   [2002]   [Feb]   [1]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: [PATCH] Radix-tree pagecache for 2.5

On 1 Feb 2002, Momchil Velikov wrote:

> Ingo> files are used. With one big file (or a few big files), the i_shared_lock
> Ingo> will always bounce between CPUs wildly in read() workloads, degrading
> Will there be difference between bounces of a rwlock in the radix tree
> variant and the cache misses in hashed locks variant for the case of
> concurrently accessed large file ?

definitely, because in the case of page buckets there are many locks
hashed in a mapping-neutral way. Ie. different parts of the same file will
likely map to different spinlocks. In the radix tree case all pages in the
inode will map to the same spinlock.


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