Name
Abstract | ||
|---|---|---|
We consider an extension of the dynamic speed scaling scheduling model introduced by Yao et al. [1]: A set of jobs, each with a release time, deadline, and workload, has to be scheduled on a single, speed-scalable processor. Both the maximum allowed speed of the processor and the energy costs may vary continuously over time. The objective is to find a feasible schedule that minimizes the total energy costs. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.tcs.2017.03.021 | Theoretical Computer Science |
Keywords | Field | DocType |
Speed scaling,Scheduling,Continuous systems,Convex programming,Calculus of variations | Direct method,Discretization,Mathematical optimization,Combinatorics,Algorithm design,Speed scaling,Workload,Scheduling (computing),Calculus of variations,Algorithm,Convex optimization,Mathematics | Journal |
Volume | ISSN | Citations |
678 | 0304-3975 | 1 |
PageRank | References | Authors |
0.36 | 15 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonios Antoniadis | 1 | 127 | 13.81 |
| Peter Kling | 2 | 34 | 6.05 |
| Sebastian Ott | 3 | 16 | 1.40 |
| Sören Riechers | 4 | 15 | 5.12 |