Open problems in real-time scheduling

DOI10.1007/S10951-009-0137-5MaRDI QIDQ633550zbMATH OpenOpenAlexFDO

Authors Sanjoy K. Baruah, Kirk 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)

Cites work

• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
• Algorithms and complexity for periodic real-time scheduling
• An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling
• EDF-schedulability of synchronous periodic task systems is coNP-hard
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Cited in

(7)

• FCFS-scheduling in a hard real-time environment under rush-hour conditions
• Optimal work-conserving scheduler synthesis for real-time sporadic tasks using supervisory control of timed discrete-event systems
• An O( m)-competitive algorithm for online machine minimization
• scientific article; zbMATH DE number 1930750 (Why is no real title available?)
• Assigning sporadic tasks to unrelated machines
• Open Problem—M/G/1 Scheduling with Preemption Delays
• Combinatorial optimization in real-time scheduling: Theory and algorithms

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

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