Online dynamic power management with hard real-time guarantees

DOI10.4230/LIPICS.STACS.2014.226MaRDI QIDQ2965486zbMATH OpenFDO

Authors Jian-Jia Chen, Mong-Jen Kao, Ignaz Rutter, Dorothea Wagner, Der-Tsai Lee

Publication date 3 March 2017

Full work available at URL https://arxiv.org/abs/1304.1590

zbMATH Keywords

energy-efficient schedulingonline dynamic power management

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online dynamic power management with hard real-time guarantees
• Competitive analysis of online real-time scheduling algorithms under hard energy constraint
• Deadline scheduling and power management for speed bounded processors
• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines

Cited in

(5)

• Online dynamic power management with hard real-time guarantees
• Applying real-time interface and calculus for dynamic power management in hard real-time systems
• Global scheduling based reliability-aware power management for multiprocessor real-time systems
• Greedy minimum-energy scheduling
• Competitive analysis of online real-time scheduling algorithms under hard energy constraint

This page was built for publication: Online dynamic power management with hard real-time guarantees

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