Difference between revisions of "Never Queue Scheduling"
From LVSKB
(No difference)
|
Revision as of 10:48, 20 July 2005
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 (The Shortest Expected Delay scheduling algorithm).
