Competitive analysis of online real-time scheduling algorithms under hard energy constraint
From MaRDI portal
(Redirected from Publication:993512)
Recommendations
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
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)