Competitive analysis of online real-time scheduling algorithms under hard energy constraint

DOI10.1007/S11241-010-9100-YMaRDI QIDQ993512zbMATH OpenOpenAlexFDO

Authors Vinay Devadas, Fei Li, Hakan Aydin

Publication date 20 September 2010

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-010-9100-y

zbMATH Keywords

competitive analysisreal-time systemsenergy management

Mathematics Subject Classification ID

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

Recommendations

• Online dynamic power management with hard real-time guarantees
• Online Deadline Scheduling with Bounded Energy Efficiency
• Online dynamic power management with hard real-time guarantees
• scientific article; zbMATH DE number 6381709
• Optimizing throughput and energy in online deadline scheduling

Cites work

• scientific article; zbMATH DE number 6381709 (Why is no real title available?)
• scientific article; zbMATH DE number 4215346 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 1306870 (Why is no real title available?)
• scientific article; zbMATH DE number 2153624 (Why is no real title available?)
• scientific article; zbMATH DE number 2086630 (Why is no real title available?)
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• On the competitiveness of on-line real-time task scheduling
• Optimal time-critical scheduling via resource augmentation
• Semi-online preemptive scheduling: one algorithm for all variants
• Speed scaling to manage energy and temperature
• Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds

Cited in

(7)

• Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints
• Automated competitive analysis of real-time scheduling with graph games
• Online energy-efficient scheduling technique analysis for hard real-time mixed tasks
• Optimizing throughput and energy in online deadline scheduling
• Clairvoyance and online scheduling in real-time energy harvesting systems
• Online dynamic power management with hard real-time guarantees
• Online dynamic power management with hard real-time guarantees

Describes a project that uses

Uses Software

• MOCA

This page was built for publication: Competitive analysis of online real-time scheduling algorithms under hard energy constraint

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