... | ... | @@ -106,18 +106,10 @@ Timing with GpioApi |
|
|
</tr>
|
|
|
<tr>
|
|
|
<td>Timing with LL_GPIO instead of GpioApi</td>
|
|
|
<td>
|
|
|
|
|
|
</td>
|
|
|
<td>
|
|
|
|
|
|
</td>
|
|
|
<td>
|
|
|
|
|
|
</td>
|
|
|
<td>
|
|
|
|
|
|
</td>
|
|
|
<td>7.6 us</td>
|
|
|
<td>12.4 us</td>
|
|
|
<td>20 us</td>
|
|
|
<td>40 %</td>
|
|
|
</tr>
|
|
|
</table>
|
|
|
|
... | ... | @@ -161,7 +153,6 @@ Timing with GpioApi\ |
|
|
</tr>
|
|
|
</table>
|
|
|
|
|
|
|
|
|
## Timing the OS overhead with an EDF scheduler
|
|
|
|
|
|
The Earliest Deadline First (EDF) algorithm is a dynamic scheduling rule that selects tasks according to their absolute deadlines. Specifically, tasks with earlier deadlines will be executed at higher priorities. Since the absolute deadline of a periodic task depends on the current nth instance, EDF is a dynamic priority assignment. It is typically executed in preemptive mode, thus the currently executing task is preempted whenever another periodic instance with earlier deadline becomes active. \
|
... | ... | |