rtems/rtems-docs
1
0
Fork 0
mirror of https://git.rtems.org/rtems-docs/ synced 2025-06-01 09:59:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

c-user/rate-monotonic/background.rst: Correct logically inverted statement

Browse Source 
Also corrected a spot of formatting.

Closes #4781.
This commit is contained in:
Joel Sherrill 2023-01-10 16:33:57 -06:00
parent 1030fea8ed
commit f48f79dcad
1 changed files with 6 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
c-user/rate-monotonic/background.rst
View File

@ -222,8 +222,9 @@ assumptions:
- The execution time for each task without preemption or interruption is
constant and does not vary.
- Any non-periodic tasks in the system are special. These tasks displace
periodic tasks while executing and do not have hard, critical deadlines.
- Any non-periodic tasks in the system are special. These tasks should not
displace periodic tasks while executing and do not have hard, critical
deadlines.
Once the basic schedulability analysis is understood, some of the above
assumptions can be relaxed and the side-effects accounted for.
@ -290,9 +291,9 @@ by the Processor Utilization Rule, they can still be guaranteed to meet all
their deadlines by application of the First Deadline Rule. This rule can be
stated as follows:
For a given set of independent periodic tasks, if each task meets its first
deadline when all tasks are started at the same time, then the deadlines will
always be met for any combination of start times.
For a given set of independent periodic tasks, if each task meets its first
deadline when all tasks are started at the same time, then the
deadlines will always be met for any combination of start times.
A key point with this rule is that ALL periodic tasks are assumed to start at
the exact same instant in time. Although this assumption may seem to be