Maintaining the Feasibility of Hard Real–Time Systems with a Reduced Number of Priority Levels

Online veröffentlicht: 30. Dez. 2015

Seitenbereich: 709 - 722

Eingereicht: 11. Okt. 2014

DOI: https://doi.org/10.1515/amcs-2015-0051

Schlüsselwörter

real-time systems, feasibility analysis, fixed-priority scheduling, rate monotonic algorithm, online scheduling

© 2015 Muhammad Bilal Qureshi et al., published by De Gruyter Open

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.