DagSemProc.10071.12.pdf
- Filesize: 139 kB
- 9 pages
We give a scalable ((1+\epsilon)-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.
Feedback for Dagstuhl Publishing