Expand description
RTAs for fixed-priority (FP) scheduling
This module collects RTAs for FP scheduling (also known as static-priority or task-level fixed-priority scheduling).
§Citation
The provided analyses are based on the following paper:
- S. Bozhko and B. Brandenburg, “Abstract Response-Time Analysis: A Formal Foundation for the Busy-Window Principle”, Proceedings of the 32nd Euromicro Conference on Real-Time Systems (ECRTS 2020), pp. 22:1–22:24, July 2020.
Please cite the paper when using functionality from this module for academic work.
Modules§
- floating_
nonpreemptive - RTA for FP scheduling with floating non-preemptive sections (FP-NPS)
- fully_
nonpreemptive - RTA for FP scheduling with fully non-preemptive jobs (NP-FP)
- fully_
preemptive - RTA for FP scheduling with fully preemptive jobs (FP)
- limited_
preemptive - RTA for FP scheduling with limited-preemptive jobs (LP-FP)