December 2017
Intermediate to advanced
534 pages
14h 57m
English
18.3 The PREEMPT RT Linux Patch
The scheduling analysis introduced in previous chapters relies on a computing model with preemptible tasks. As soon as an event makes any task computable, the latter will contend for the processor, possibly becoming the current task in the case where its priority is greater than all the other computable tasks at that time. While in the model the task switch is considered instantaneous, in real-world systems this is not the case, and the delay between event ...
Read now
Unlock full access