#26 RTOS Part-5: What is “real-time”? Preemptive, priority-based scheduling

In this fifth lesson on RTOS I’ll finally address the real-time aspect in the “Real-Time Operating System” name. Specifically, in this lesson, you will augment the MiROS RTOS with a preemptive, priority-based scheduler, which can be mathematically proven to meet real-time deadlines under certain conditions.

Articles mentioned in the lesson:
———————————
C.L.Liu and James W. Layland “Scheduling Algorithms for Multiprogramming in Hard-Real-Time Environment” January 1973Journal of the ACM 20(1):46-61
https://www.researchgate.net/publication/220431427_Scheduling_Algorithms_for_Multiprogramming_in_Hard-Real-Time_Environment

Lui Sha Mark H. Klein John B. Goodenough “Rate Monotonic Analysis for Real-Time Systems”
Technical Report CMU/SEI-91-TR-6 ESD-91-TR-6
http://www2.informatik.uni-stuttgart.de/iste/ps/AdaBasis/pal_1195/ada/sei/documents/91.reports/pdf/tr06.91.pdf

——
Resources:

Companion web page for this video course:
https://www.state-machine.com/quickstart

GitHub repository for projects for this video course:
https://github.com/QuantumLeaps/modern-embedded-programming-course

Transcript of this lesson:
https://www.state-machine.com/course/lesson26.txt

Music credits:
The background music comes from:
https://www.bensound.com/royalty-free-music/track/straight