Add VM data structure/algorithm task from jeff/alc.

This commit is contained in:
Robert Watson 2008-03-19 11:28:40 +00:00
parent 000bf9f77e
commit 3e32d41f1b
Notes: svn2git 2020-12-08 03:00:23 +00:00
svn path=/www/; revision=31694

View file

@ -15,7 +15,7 @@ Ideas//EN"
<ideas>
<cvs:keywords xmlns:cvs="http://www.FreeBSD.org/XML/CVS" version="1.0">
<cvs:keyword name="freebsd">
$FreeBSD: www/en/projects/ideas/ideas.xml,v 1.59 2008/03/19 11:01:26 rwatson Exp $
$FreeBSD: www/en/projects/ideas/ideas.xml,v 1.60 2008/03/19 11:23:06 rwatson Exp $
</cvs:keyword>
</cvs:keywords>
@ -914,6 +914,28 @@ href="http://info.iet.unipi.it/~luigi/FreeBSD/linux_bsd_kld.html">here</a>.</p>
</desc>
</idea>
<idea id="vmalgorithm" class="soc">
<title>VM Algorithm Improvement</title>
<desc>
<p><strong>Technical contact</strong>: <a
href="mailto:jeff@FreeBSD.org">Jeff Roberson</a>, <a
href="mailto:alc@FreeBSD.org">Alan Cox</a></p>
<p>The vm uses a splay tree to lookup pages associated with an offset and a
file. This tree structure is space inefficient and cache inefficient for
large objects. This project will be to replace the splay with a dynamic
depth page-table like structure similar to a radix tree. This will improve
large object performance and reduce the size of the vm_page.</p>
<p><strong>Requirements</strong>:</p>
<ul>
<li>Strong knowledge of C.</li>
<li>Familiarity with concepts of virtual memory and advanced data
structures and algorithms.</li>
</ul>
</desc>
</idea>
</category>
<category>