Scalably scheduling processes with arbitrary speedup curves
Jeff A. Edmonds, Kirk R. Pruhs · 2009
We give a scalable ((1+ǫ)-speed O(1)-competitive) nonclairvoyant algorithm for scheduling jobs with sublinear nondecreasing speed-up curves on multiple processors with the objective of average response time. 1