Lines Matching refs:cache

25 Overview of supplied cache replacement policies
34 waiting for the cache and another two for those in the cache (a set for
38 the cache is based on variable thresholds and queue selection is based
39 on hit count on entry. The policy aims to take different cache miss
51 considered sequential it will bypass the cache.  The random threshold
61 promote sequential blocks to the cache (e.g. fast application startup).
63 disabled and sequential I/O will no longer implicitly bypass the cache.
68 count of a block not in the cache goes above this threshold it gets
69 promoted to the cache.  The read, write and discard promote adjustment
72 If you're trying to quickly warm a new cache device you may wish to
74 their defaults after the cache fills though.
89 DM table that is using the cache target.  Doing so will cause all of the
90 mq policy's hints to be dropped.  Also, performance of the cache may
95 The mq policy uses a lot of memory; 88 bytes per cache block on a 64
100 has a 'hotspot' queue rather than a pre cache which uses a quarter of
102 cache block).
104 All these mean smq uses ~25bytes per cache block.  Still a lot of
121 The MQ policy maintains a hit count for each cache block.  For a
122 different block to get promoted to the cache it's hit count has to
123 exceed the lowest currently in the cache.  This means it can take a
124 long time for the cache to adapt between varying IO patterns.
140 The cleaner writes back all dirty blocks in a cache to decommission it.
146 	cache <metadata dev> <cache dev> <origin dev> <block size>
155 	dmsetup create blah --table "0 268435456 cache /dev/sdb /dev/sdc \