<?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="Scheduling (computing) - Page 21 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Scheduling_(computing)&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Scheduling_%28computing%29&amp;p=22">3.Next</a>
</p>
<p>disk drives (<a href="page.php?w=I%2FO_scheduling">I/O scheduling</a>), printers (<a href="page.php?w=print_spooler">print spooler</a>), most embedded systems, etc.</p>

<p>The main purposes of scheduling algorithms are to minimize <a href="page.php?w=resource_starvation">resource starvation</a> and to ensure fairness amongst the parties utilizing the resources. Scheduling deals with the problem of deciding which of the outstanding requests is to be allocated resources. There are many different scheduling algorithms. In this section, we introduce</p><p>
<a accesskey="1" href="page.php?w=Scheduling_(computing)&amp;p=20">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Scheduling_%28computing%29&amp;p=22">3.Next</a>
</p>

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

</card>
</wml>
