Speaker
Vlastimil Babka
(SUSE)
Description
It is generally known that Linux memory reclaim uses LRU ordered lists to decide which pages to evict to free memory for new pages. It might be less known that there are separate lists for file (page cache) and anonymous pages, and that both are further split in active and inactive parts. There are however lots of subtle details of how the relative sizes of these four lists are balanced, and things also changed recently with e.g. addition of workingset refault detection.
This talk will summarize the current reclaim implementation in detail, and also major proposed changes such as multigenerational LRU.
| I agree to abide by the anti-harassment policy | I agree |
|---|
Primary author
Vlastimil Babka
(SUSE)
