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

DOI10.1007/S11241-015-9225-0zbMath1351.68044OpenAlexW2043148658MaRDI QIDQ255289

Wang Yi, Pontus Ekberg

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

real-timemixed-criticalityschedulability analysistask graphs

Mathematics Subject Classification ID

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

Related Items (1)

Approximation algorithms for replenishment problems with fixed turnover times

Cites Work

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

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