Open problems in real-time scheduling

DOI10.1007/S10951-009-0137-5zbMath1208.90054OpenAlexW2033048442MaRDI QIDQ633550

Sanjoy K. Baruah, Kirk R. Pruhs

Publication date: 1 April 2011

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-009-0137-5

zbMATH Keywords

open problemsreal-time scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization ⋮ Assigning sporadic tasks to unrelated machines ⋮ Feasibility analysis of sporadic real-time multiprocessor task systems ⋮ Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems

Cites Work

• Unnamed Item
• Unnamed Item
• A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: Open problems in real-time scheduling