Race to idle

DOI10.1145/2556953zbMath1321.68492OpenAlexW2135755782MaRDI QIDQ5501963

Antonios Foivos Antoniadis, Susanne Albers

Publication date: 14 August 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2556953

zbMATH Keywords

approximation algorithmNP-hardpower-down mechanismvariable-speed processor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items

A survey of offline algorithms for energy minimization under deadline constraints, A greedy approximation algorithm for minimum-gap scheduling, An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules, Race to idle or not: balancing the memory sleep time with DVS for energy minimization, Speed scaling problems with memory/cache consideration, A fully polynomial-time approximation scheme for speed scaling with a sleep state, Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines, Online dynamic power management with hard real-time guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average rate speed scaling
• Deadline scheduling and power management for speed bounded processors
• Scheduling for weighted flow time and energy with rejection penalty
• Min-energy voltage allocation for tree-structured tasks
• Optimizing throughput and energy in online deadline scheduling
• Speed Scaling with an Arbitrary Power Function
• Polynomial-time algorithms for minimum energy scheduling
• Scheduling for Speed Bounded Processors
• Speed scaling to manage energy and temperature
• Scheduling unit tasks to minimize the number of idle periods
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules