License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25463
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2546/

Edmonds, Jeff ; Pruhs, Kirk

Scalably Scheduling Processes with Arbitrary Speedup Curves

pdf-format:
Dokument 1.pdf (140 KB)


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:DSP:2010:2546,
  author =	{Jeff Edmonds and Kirk Pruhs},
  title =	{Scalably Scheduling Processes with Arbitrary Speedup Curves},
  booktitle =	{Scheduling},
  year =	{2010},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M{\"o}hring and Kirk Pruhs},
  number =	{10071},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2546},
  annote =	{Keywords: Scheduling}
}

Keywords: Scheduling
Seminar: 10071 - Scheduling
Issue date: 2010
Date of publication: 03.05.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI