Name
Abstract | ||
|---|---|---|
Abstract ‐ We address task scheduling on mul- tiprocessor computers,with dynamically,variable voltage and speed as a combinatorial,optimiza- tion problem. We define the problem,of minimiz- ing schedule length with energy consumption,con- straint on multiprocessor computers. We derive a lower bound,for the optimal schedule length for the problem,of minimizing,schedule length with energy consumption,constraint. Keywords: Energy consumption, lower bound, |
Year | Venue | Keywords |
|---|---|---|
2006 | PDPTA | task scheduling.,energy consumption,power-aware scheduling,lower bound |
Field | DocType | Citations |
Fixed-priority pre-emptive scheduling,Multiprocessor scheduling,Fair-share scheduling,Computer science,Parallel computing,Two-level scheduling,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling | Conference | 1 |
PageRank | References | Authors |
0.38 | 10 | 1 |