Difference between revisions of "Never Queue Scheduling"
From LVSKB
m |
m |
||
| Line 1: | Line 1: | ||
| − | The never queue scheduling algorithm adopts a two-speed model. When there is an idle server available, the job will be sent to the idle server, instead of waiting for a fast one. When there is no idle server available, the job will be sent to the server that minimize its expected delay (see the [[Shortest Expected Delay Scheduling]] algorithm). | + | The never queue scheduling algorithm adopts a two-speed model. |
| + | # When there is an idle server available, the job will be sent to the idle server, instead of waiting for a fast one. | ||
| + | # When there is no idle server available, the job will be sent to the server that minimize its expected delay (see the [[Shortest Expected Delay Scheduling]] algorithm). | ||
[[Category:Job Scheduling Algorithms]] | [[Category:Job Scheduling Algorithms]] | ||
Latest revision as of 15:56, 16 October 2006
The never queue scheduling algorithm adopts a two-speed model.
- When there is an idle server available, the job will be sent to the idle server, instead of waiting for a fast one.
- When there is no idle server available, the job will be sent to the server that minimize its expected delay (see the Shortest Expected Delay Scheduling algorithm).
