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

DOI10.1142/S0129054103001789zbMath1101.68423OpenAlexW2026772887MaRDI QIDQ5696914

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)

Cites Work

• On the competitiveness of on-line real-time task scheduling
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

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