Difference between revisions of "Shortest Expected Delay Scheduling"

From LVSKB
Jump to: navigation, search
m
m (bold the formula)
 
Line 1: Line 1:
The shortest expected delay scheduling algorithm assigns network connections to the server with the shortest expected delay. The expected delay that the job will experience is (C<sub>i</sub> + 1) / U<sub>i</sub> if sent to the ''i''th server, in which C<sub>i</sub> is the number of connections on the the ''i''th server and U<sub>i</sub> is the fixed service rate (weight) of the ''i''th server.
+
The shortest expected delay scheduling algorithm assigns network connections to the server with the shortest expected delay. The expected delay that the job will experience is '''(C<sub>i</sub> + 1) / U<sub>i</sub>''' if sent to the ''i''th server, in which C<sub>i</sub> is the number of connections on the the ''i''th server and U<sub>i</sub> is the fixed service rate (weight) of the ''i''th server.
  
 
[[Category:Job Scheduling Algorithms]]
 
[[Category:Job Scheduling Algorithms]]

Latest revision as of 16:03, 13 April 2007

The shortest expected delay scheduling algorithm assigns network connections to the server with the shortest expected delay. The expected delay that the job will experience is (Ci + 1) / Ui if sent to the ith server, in which Ci is the number of connections on the the ith server and Ui is the fixed service rate (weight) of the ith server.