<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Memory hierarchy - Page 14 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=memory_hierarchy&amp;p=13">1.Previous</a><br />
<a accesskey="3" href="page.php?w=memory_hierarchy&amp;p=15">3.Next</a>
</p>
<p>be considered a form of tiering.</p>

<p>Memory tiering is implemented on Linux as an extension to NUMA, where each memory provider has a CPU-less NUMA node with an appropriate "abstract distance" reflecting its performance. The existing scheme for migrating memory between NUMA nodes using "hotness" indicated by <a href="page.php?w=page_fault">page fault</a>s is adapted to tiering by Huang Ying (Al Maruf's TPP scheme is not in Linux mainline). It also uses a weighted-interleave allocation policy.</p>

<p><big>See also</big></p>
<p>
* <a href="page.php?w=Cache_hierarchy">Cache hierarchy</a><br/></p><p>
<a accesskey="1" href="page.php?w=memory_hierarchy&amp;p=13">1.Previous</a><br />
<a accesskey="3" href="page.php?w=memory_hierarchy&amp;p=15">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
