Intractability issues in mixed-criticality scheduling

DOI10.4230/LIPICS.ECRTS.2018.11MaRDI QIDQ5140795zbMATH OpenFDO

Authors Kunal Agrawal, Sanjoy K. Baruah

Publication date 16 December 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ECRTS.2018.11

zbMATH Keywords

approximation ratiocompetitive ratiomixed-criticality schedulingNP-completeness resultsspeedup factorsporadic tasks

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Mixed-criticality scheduling of sporadic task systems
• Scheduling real-time mixed-criticality jobs
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem
• Mixed-criticality scheduling on multiprocessors
• Priority-based scheduling of mixed-critical jobs

Cites work

• Bounds on Multiprocessing Timing Anomalies
• NP-complete scheduling problems
• On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Scheduling Real-Time Mixed-Criticality Jobs

Cited in

(3)

• Narrowing the speedup factor gap of partitioned EDF
• Special issue on multiprocessor and mixed-criticality scheduling
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem

This page was built for publication: Intractability issues in mixed-criticality scheduling

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