Algorithms and Data Structures

DOI10.1007/11534273zbMATH Open1161.90390OpenAlexW3010016474MaRDI QIDQ5394262FDOQ5394262

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

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

Mathematics Subject Classification ID

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

Cited In (9)

• Non-preemptive speed scaling
• Voltage-clock scaling for low energy consumption in fixed-priority real-time systems
• Speed scaling of tasks with precedence constraints
• Power-aware scheduling for makespan and flow
• Speed scaling on parallel processors
• 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
• On one problem of construction of energy-saving schedules
• Resource cost aware scheduling

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)