KSM, simply put is a service daemon which scans the page addresses to find duplicate pages, merges them and therefore reduces the memory density. The code used in this post as example can be found under /mm/ksm.c in the kernel source.
Before continuing, it is important to keep in mind that:
- KSM uses a red-black tree for the stable and unstable trees - efficiency is per tree since the height can never be more than with n being the number of nodes.
- KSM only scans anonymous pages, file backed pages such as HugePages are not scanned and cannot be merged by KSM. This is different to Transparent Huge pages where as in RedHat 6.1, KSM will break up THP into small pages if shareable 4K pages are found and only if the system is running out of memory.
- Merged pages are read-only as they are CoW protected.
- Userspace application can register candidate regions for merging through the madwise() system call. We will not tackle the KSM API details in this post.
- Because of the CoW nature, a merged page write action by an application will raise a page fault, which in return triggers the break_cow() routine, which issue a copy of the merged page to the writing application.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
With this in mind, here is a summarized view on how KSM works per steps
KSM scan pages and elects whether a page could be considered to be merged… these pages are referred as “candidate” pages. To quickly state it, a candidate page which does not exists in the stable tree is added as a node to the unstable tree, but we will get to this later in the post. To determine if a page has changed or not, KSM relies on a 32bit checksum, which is then added to the page content and evaluated on the next scan.
1 2 3 4 5 6 7 8
In other words, KSM finds page X, creates a checksum, stores it in page X - on the next scan, if the checksum of page X did not change, then it is considered as a candidate page.
For each candidate page, KSM starts a memcmp_pages() operation to the stable tree which contains the merged pages.
1 2 3 4 5 6 7 8 9 10 11 12
This unique process is as follow:
1 2 3 4 5 6 7 8 9 10
Understanding the following requires an understanding of how a binary tree works in general, more specifically how a red-black tree works.
The stable tree is walked left if the candidate page is less than the page in the stable tree, right if the candidate page is superior to the stable page and the page is simply merge and the candidate page freed if both pages are identical.
The stable tree search function is referenced at http://lxr.free-electrons.com/source/mm/ksm.c#L985
Now if the candidate page was not found in the stable tree, its checksum is re-computed to determine whether the data has changed since or not. If it has changed it is then ignored; if not, the searching process continues in the unstable tree as with the search in the stable tree. The recursion __unstable_tree_search_insert() __can be seen at http://lxr.free-electrons.com/source/mm/ksm.c#L1078.
While searching the unstable tree, KSM will create a new node in this binary tree if the candidate page is unique
1 2 3 4
and if not unique such as the unstable tree contains similar candidate pages, it will be merged to the existing similar node and moved to the stable tree.
Once the KSM scan is done, the unstable tree is destroyed and recreated on the next iteration
I hope that was informative.