summaryrefslogtreecommitdiff
path: root/fs/mbcache.c
diff options
context:
space:
mode:
authorJan Kara <jack@suse.cz>2016-02-22 18:23:47 -0500
committerTheodore Ts'o <tytso@mit.edu>2016-02-22 18:23:47 -0500
commitf0c8b46238db9d51ef9ea0858259958d0c601cec (patch)
tree67a5822eb2c25bf5c89e6e52a81e6fc8cde7d7ba /fs/mbcache.c
parentc2f3140fe2eceb3a6c1615b2648b9471544881c6 (diff)
mbcache2: Use referenced bit instead of LRU
Currently we maintain perfect LRU list by moving entry to the tail of the list when it gets used. However these operations on cache-global list are relatively expensive. In this patch we switch to lazy updates of LRU list. Whenever entry gets used, we set a referenced bit in it. When reclaiming entries, we give referenced entries another round in the LRU. Since the list is not a real LRU anymore, rename it to just 'list'. In my testing this logic gives about 30% boost to workloads with mostly unique xattr blocks (e.g. xattr-bench with 10 files and 10000 unique xattr values). Signed-off-by: Jan Kara <jack@suse.cz> Signed-off-by: Theodore Ts'o <tytso@mit.edu>
Diffstat (limited to 'fs/mbcache.c')
0 files changed, 0 insertions, 0 deletions