An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems

DOI10.1007/S11241-017-9287-2zbMath1425.68043OpenAlexW2745071378MaRDI QIDQ1698775

Mehdi Kargahi, Sedigheh Asyaban

Publication date: 16 February 2018

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

Full work available at URL: https://doi.org/10.1007/s11241-017-9287-2

zbMATH Keywords

real-time systemspreemptive schedulingmixed-criticalityschedulability analysisfixed-priority

Mathematics Subject Classification ID

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

Related Items (1)

Commentary to: ``An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems

Cites Work

• Graph-based models for real-time workload: a survey
• Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities
• Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
• Feasibility analysis of sporadic real-time multiprocessor task systems
• Measuring the performance of schedulability tests
• Approximation techniques for response-time analysis of static-priority tasks
• On priority assignment in fixed priority scheduling
• Bounding and shaping the demand of generalized mixed-criticality sporadic task systems
• Mixed-Criticality Scheduling of Sporadic Task Systems
• Efficient Exact Schedulability Tests for Fixed Priority Real-Time Systems
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

This page was built for publication: An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems