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

DOI10.1007/s11241-010-9100-yzbMath1204.68037OpenAlexW2147746266MaRDI QIDQ993512

Hakan Aydin, Vinay Devadas, Fei Li

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

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

Related Items

Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ Clairvoyance and online scheduling in real-time energy harvesting systems

Uses Software

• MOCA

Cites Work

• On the competitiveness of on-line real-time task scheduling
• Speed scaling to manage energy and temperature
• Utility Accrual Real-Time Scheduling Under the Unimodal Arbitrary Arrival Model with Energy Bounds
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Semi-Online Preemptive Scheduling: One Algorithm for All Variants.
• Optimal time-critical scheduling via resource augmentation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item