Schedulability analysis of a graph-based task model for mixed-criticality systems

DOI10.1007/S11241-015-9225-0MaRDI QIDQ255289zbMATHOpenAlexFDO

Authors Pontus Ekberg, Wang Yi

Publication date 9 March 2016

Published in Real-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11241-015-9225-0

zbMATH Keywords

mixed-criticalityreal-timeschedulability analysistask graphs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Mixed-criticality scheduling with limited hi-criticality behaviors
• Graph-based models for real-time workload: a survey
• Mixed-criticality scheduling of sporadic task systems
• Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
• Mixed-criticality scheduling on multiprocessors

Cites work

• Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
• Combinatorial abstraction refinement for feasibility analysis of static priorities
• Mixed-criticality scheduling of sporadic task systems
• Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems
• Scheduling Real-Time Mixed-Criticality Jobs
• Statecharts: a visual formalism for complex systems

Cited in

(3)

• Approximation algorithms for replenishment problems with fixed turnover times
• Graph-based models for real-time workload: a survey
• scientific article; zbMATH DE number 969979 (Why is no real title available?)

This page was built for publication: Schedulability analysis of a graph-based task model for mixed-criticality systems

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