A Fully Polynomial-Time Approximation Scheme for Speed Scaling with a Sleep State

We study classical deadline-based preemptive scheduling of jobs in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each job is specified by a release time, a deadline and a processing volume, and has to be scheduled on a single, speed-scalable processor...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 81; číslo 9; s. 3725 - 3745
Hlavní autoři:	Antoniadis, Antonios, Huang, Chien-Chung, Ott, Sebastian
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 16.09.2019 Springer Nature B.V Springer Verlag
Témata:	Algorithm Analysis and Problem Complexity Algorithms Approximation Complexity Computational Geometry Computer Science Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Energy consumption Lower bounds Mathematical analysis Mathematics of Computing Microprocessors Polynomials Preempting Production scheduling Scaling Schedules Sleep Theory of Computation Approximation algorithms Polynomial-time approximation scheme Energy efficiency
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!