<?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 paging - Page 22 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Memory_paging&amp;p=21">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Memory_paging&amp;p=23">3.Next</a>
</p>
<p>work most efficiently and an insignificant amount of computing is spent resolving page faults. As the working set grows, resolving page faults remains manageable until the growth reaches a critical point. Then faults go up dramatically and the time spent resolving them overwhelms time spent on the computing the program was written to do. This condition is referred to as <a href="page.php?w=Thrashing_%28computer_science%29">thrashing</a>. Thrashing occurs on a program that works with huge data structures, as its large working set causes continual</p><p>
<a accesskey="1" href="page.php?w=Memory_paging&amp;p=21">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Memory_paging&amp;p=23">3.Next</a>
</p>

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

</card>
</wml>
