Scalably Scheduling Processes with Arbitrary Speedup Curves

Authors Jeff Edmonds, Kirk Pruhs



PDF
Thumbnail PDF

File

DagSemProc.10071.12.pdf
  • Filesize: 139 kB
  • 9 pages

Document Identifiers

Author Details

Jeff Edmonds
Kirk Pruhs

Cite AsGet BibTex

Jeff Edmonds and Kirk Pruhs. Scalably Scheduling Processes with Arbitrary Speedup Curves. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.10071.12

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.
Keywords
  • Scheduling

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail