Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10071.12
URN: urn:nbn:de:0030-drops-25463
URL: https://drops.dagstuhl.de/opus/volltexte/2010/2546/
Edmonds, Jeff ; Pruhs, Kirk
Scalably Scheduling Processes with Arbitrary Speedup Curves
| pdf-format: |
|
Abstract
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.
BibTeX - Entry
@InProceedings{edmonds_et_al:DagSemProc.10071.12,
author = {Edmonds, Jeff and Pruhs, Kirk},
title = {{Scalably Scheduling Processes with Arbitrary Speedup Curves}},
booktitle = {Scheduling},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10071},
editor = {Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2010/2546},
URN = {urn:nbn:de:0030-drops-25463},
doi = {10.4230/DagSemProc.10071.12},
annote = {Keywords: Scheduling}
}
| Keywords: | Scheduling | |
| Seminar: | 10071 - Scheduling | |
| Issue date: | 2010 | |
| Date of publication: | 03.05.2010 |
