Thread (21 messages) 21 messages, 5 authors, 2016-02-12

Re: computing drop-able caches

From: Rik van Riel <hidden>
Date: 2016-01-29 22:41:43
Also in: linux-fsdevel, lkml

On 01/28/2016 08:55 PM, Johannes Weiner wrote:
On Thu, Jan 28, 2016 at 05:29:41PM -0800, Daniel Walker wrote:
quoted
On 01/28/2016 05:03 PM, Daniel Walker wrote:
[regarding MemAvaiable]

This new metric purportedly helps usrespace assess available memory. But,
its again based on heuristic, it takes 1/2 of page cache as reclaimable..
No, it takes the smaller value of cache/2 and the low watermark, which
is a fraction of memory. Actually, that does look a little weird. Rik?
No, not quite.  The page cache calculation spans two lines:

        pagecache = pages[LRU_ACTIVE_FILE] + pages[LRU_INACTIVE_FILE];
        pagecache -= min(pagecache / 2, wmark_low);

The assumption is that ALL of active & inactive file LRUs are
freeable, except for the minimum of the low watermark, or
half the page cache.

-- 
All rights reversed

--
To unsubscribe, send a message with 'unsubscribe linux-mm' in
the body to majordomo@kvack.org.  For more info on Linux MM,
see: http://www.linux-mm.org/ .
Don't email: <a href=mailto:"dont@kvack.org"> email@kvack.org </a>
Keyboard shortcuts
hback out one level
jnext message in thread
kprevious message in thread
ldrill in
Escclose help / fold thread tree
?toggle this help