Scheduling Real-Time Mixed-Criticality Jobs

DOI10.1109/TC.2011.142MaRDI QIDQ5274656zbMATH OpenOpenAlexWikidataFDO

Authors Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo D'Angelo, Haohan Li, Nicole Megow, Alberto Marchetti-Spaccamela, L. Stougie

Publication date 12 July 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2011.142

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(16)

• Schedulability analysis of a graph-based task model for mixed-criticality systems
• The triangle scheduling problem
• A fault-tolerant time-triggered scheduling algorithm of mixed-criticality systems
• Fault-tolerant and real-time scheduling for mixed-criticality systems
• Implementing mixed-criticality synchronous reactive programs upon uniprocessor platforms
• Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
• Scheduling with uncertain processing times in mixed-criticality systems
• Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
• Intractability issues in mixed-criticality scheduling
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem
• Dynamic budget management and budget reclamation for mixed-criticality systems
• FFOB: efficient online mode-switch procrastination in mixed-criticality systems
• Priority-based scheduling of mixed-critical jobs
• Speed-robust scheduling. Sand, bricks, and rocks
• Graph-based models for real-time workload: a survey
• Speed-robust scheduling: sand, bricks, and rocks

This page was built for publication: Scheduling Real-Time Mixed-Criticality Jobs

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