This is an old revision of the document!

Title

VM Algorithm Improvement: Better Data Structures and Algorithms to Support Large VM Objects.

Objective

For management of resident pages the splay trees are used, which are not suitable for the purpose. The objective is to replace the splay tree with another data-structure such that even ordered traversal is possible. The ordered traversal will allow us to reduce size of structure vm_page.

Plan

• To implement the new data structure in user-space first. Test for memory leaks and correctness. Evaluate space and time efficiency.
• Move the code to kernel and run the new data structure parallel to old data structure, test for identical functionality.
• Performance evaluation.

TODO Will be updated soon.