Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Speed Scaling with an Arbitrary Power Function

Bansal, N., Chan, H.-L., & Pruhs, K. (2009). Speed Scaling with an Arbitrary Power Function. In C. Mathieu (Ed.), Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 693-701). Philadelphia, PA: SIAM.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-18D3-F Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0028-3AB3-B
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Bansal, Nikhil1, Autor
Chan, Ho-Leung2, Autor           
Pruhs, Kirk1, Autor
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: All of the theoretical speed scaling research to date has assumed that the power function, which expresses the power consumption $P$ as a function of the processor speed $s$, is of the form $P=s^\alpha$, where $\alpha > 1$ is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary power functions. We consider the problem of minimizing the total flow plus energy. Our main result is a $(3+\epsilon)$-competitive algorithm for this problem, that holds for essentially any power function. We also give a $(2+\epsilon)$-competitive algorithm for the objective of fractional weighted flow plus energy. Even for power functions of the form $s^\alpha$, it was not previously known how to obtain competitiveness independent of $\alpha$ for these problems. We also introduce a model of allowable speeds that generalizes all known models in the literature.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2009-03-212009
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 518345
DOI: 10.1137/1.9781611973068.76
Anderer: Local-ID: C1256428004B93B8-194C06E65A88E9CDC125754D0037BD9F-Chan2008b
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Veranstaltungsort: New York, NY, USA
Start-/Enddatum: 2009-01-04 - 2009-01-06

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
  Kurztitel : SODA 2009
Genre der Quelle: Konferenzband
 Urheber:
Mathieu, Claire, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Philadelphia, PA : SIAM
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 693 - 701 Identifikator: -