Title

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

TODO

UPDATES

Benchmarking Results:

Here are benchmarking results with preallocation,

[insert operation performs better here compared to malloc.]

Look-up


TSC difference after lookups: 1313747

Measuring time for 65535 lookup operations on splay tree with 4095 elements

TSC difference after lookups: 302694361


Measuring time for 65535 inserts on radix tree with 4095 elements

TSC difference after inserts: 2431122

Measuring time for 65535 inserts on splay tree with 4095 elements

TSC difference after inserts: 127930972


Measuring time for 65535 removes on radix tree

TSC difference after removes: 168615

Measuring time for 65535 removes on splay tree

TSC difference after removes: 375269656

MayurShardul/VM_Algorithm_Improvement (last edited 2008-08-28 06:26:59 by MayurShardul)