<?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 23 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=scheduling_(computing)&amp;p=22">1.Previous</a><br />
<a accesskey="3" href="page.php?w=scheduling_%28computing%29&amp;p=24">3.Next</a>
</p>
<p>(a <a href="page.php?w=max-min_fair">max-min fair</a> scheduling algorithm), <a href="page.php?w=proportional-fair_scheduling">proportional-fair scheduling</a> and <a href="page.php?w=maximum_throughput_scheduling">maximum throughput</a>. If differentiated or guaranteed <a href="page.php?w=quality_of_service">quality of service</a> is offered, as opposed to best-effort communication, <a href="page.php?w=weighted_fair_queuing">weighted fair queuing</a> may be utilized.</p>

<p>In advanced packet radio wireless networks such as <a href="page.php?w=HSDPA">HSDPA</a></p><p>
<a accesskey="1" href="page.php?w=scheduling_(computing)&amp;p=22">1.Previous</a><br />
<a accesskey="3" href="page.php?w=scheduling_%28computing%29&amp;p=24">3.Next</a>
</p>

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

</card>
</wml>
