Answers are grounded in this paper and cite their sources.
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
No takes yet. Share an insight, caveat, or question.
Edmonds et al. (2009) studied this question.