Comparison of PS, SRPT, and FB scheduling policies under exponential and heavy tail job sizes

We present numerical analysis that campares the performances of PS, SRPT , and FB scheduling policies in terms of their conditional mean response times in an M/G/1 model, where G represents an exponential job size distribution or a job size distributionwith highly varying sizes such as heavy
tailed distribution. The results show that for heavy tailed job size distribution, FB offers mean slowdown
close to SRPT and a small percentage of the largest jobs experiences a higher slowdown under
FB than under PS.