ESA
2003
Springer
14 years 5 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
SIGMETRICS
2004
ACM
14 years 6 months ago
2004
ACM
The Least Attained Service (LAS) scheduling policy, when used for scheduling packets over the bottleneck link of an Internet path, can greatly reduce the average flow time for sh...