On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees

DOI10.1142/S0129054103001789MaRDI QIDQ5696914zbMATH OpenOpenAlexFDO

Authors Michael A. Palis

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054103001789

zbMATH Keywords

task scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Rate monotonic scheduling in hard real-time systems
• scientific article; zbMATH DE number 1670533
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines
• scientific article; zbMATH DE number 1834669
• On the competitiveness of on-line real-time task scheduling

Cites work

• $\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
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(4)

• Competitive on-line scheduling of continuous-media streams
• Improving adaptivity and fairness of processing real-time tasks with QoS requirements on clusters through dynamic scheduling
• On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
• Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling

This page was built for publication: On the Competitiveness of Online Real-Time Scheduling with Rate of Progress Guarantees

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