Expand description
An RTA for first-in first-out (FIFO) scheduling
This module provides an RTA for the FIFO policy, also commonly known as first-come first-serve (FCFS) scheduling.
§Citation
The provided analysis was proposed in the following paper:
- K. Bedarkar, M. Vardishvili, S. Bozhko, M. Maida, and B. Brandenburg, “From Intuition to Coq: A Case Study in Verified Response-Time Analysis of FIFO Scheduling”, Proceedings of the 43rd IEEE Real-Time Systems Symposium (RTSS 2022), pp. 197–210, December 2022.
Please cite the paper when using this module for academic work.
Functions§
- dedicated_
uniproc_ rta - Try to find a response-time bound for any task in a task set under FIFO scheduling on a dedicated uniprocessor.