Algorithms and Data Structures

DOI10.1007/11534273MaRDI QIDQ5394262zbMATH OpenOpenAlexFDO

Authors Jian-Jia Chen, Tei-Wei Kuo, Hsueh-I Lu

Publication date 25 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11534273

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On one problem of construction of energy-saving schedules
• Non-preemptive speed scaling
• Energy-efficient algorithms for non-preemptive speed-scaling
• Non-preemptive Speed Scaling
• On a certain class of power- and energy-related scheduling problems

Cited in

(9)

• Power-aware scheduling for makespan and flow
• Energy efficient voltage scheduling for multi-core processors with software controlled dynamic voltage scaling
• A Monte Carlo algorithm for real time task scheduling on multi-core processors with software controlled dynamic voltage scaling
• Resource cost aware scheduling
• On one problem of construction of energy-saving schedules
• Voltage-clock scaling for low energy consumption in fixed-priority real-time systems
• Non-preemptive speed scaling
• Speed scaling on parallel processors
• Speed scaling of tasks with precedence constraints

This page was built for publication: Algorithms and Data Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394262)