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

DOI10.1007/S11241-020-09345-0zbMATH Open1436.68070OpenAlexW3011290607MaRDI QIDQ779470FDOQ779470

Authors: Ivan Pavić, Hrvoje Džapo 

Publication date: 13 July 2020

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

Full work available at URL: https://doi.org/10.1007/s11241-020-09345-0

Recommendations

• An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
• Errata: A new algorithm for scheduling periodic, real-time tasks
• Priority-based scheduling of mixed-critical jobs
• Liu and Layland's schedulability test revisited
• Comments on ``Generalized rate monotonic schedulability bounds using relative period ratios

zbMATH Keywords

fixed priorityschedulability testmixed-criticality systems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• An exact schedulability test for fixed-priority preemptive mixed-criticality real-time systems
• Errata: A new algorithm for scheduling periodic, real-time tasks

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

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