RTOS/rtems
1
0
Fork 0
forked from Imagelibrary/rtems
Code Pull Requests Activity

2003-09-19 Joel Sherrill <joel@OARcorp.com>

Browse Source 
* c_user.texi, fatal.t, preface.texi, rtmon.t: Merge from branch.
This commit is contained in:
Joel Sherrill
2003-09-19 18:02:21 +00:00
parent 330dbdb055
commit 44e71298b1
3 changed files with 12 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/user/ChangeLog
View File

@@ -1,3 +1,7 @@
2003-09-19 Joel Sherrill <joel@OARcorp.com>
* c_user.texi, fatal.t, preface.texi, rtmon.t: Merge from branch.
2003-05-22 Ralf Corsepius <corsepiu@faw.uni-ulm.de>
* fatal.t: Reflect c/src/exec having moved to cpukit.

1
doc/user/c_user.texi
View File

@@ -26,6 +26,7 @@
@include version.texi
@include common/setup.texi
@include common/rtems.texi
@ifset use-ascii
@dircategory RTEMS On-Line Manual

18
doc/user/rtmon.t
View File

@@ -215,9 +215,7 @@ can meet all deadlines, even under transient overload, without
knowing exactly when any given task will execute by applying
proven schedulability analysis rules.
@lowersections
@subsection Assumptions
@subsubsection Assumptions
The schedulability analysis rules for RMS were
developed based on the following assumptions:
@@ -245,7 +243,7 @@ Once the basic schedulability analysis is understood,
some of the above assumptions can be relaxed and the
side-effects accounted for.
@subsection Processor Utilization Rule
@subsubsection Processor Utilization Rule
@cindex RMS Processor Utilization Rule
@@ -279,7 +277,7 @@ greater utilization factor. In fact, the average processor
utilization threshold for a randomly generated task set is
approximately 0.88.
@subsection Processor Utilization Rule Example
@subsubsection Processor Utilization Rule Example
This example illustrates the application of the
Processor Utilization Rule to an application with three critical
@@ -361,7 +359,7 @@ The total processor utilization for this task set is
0.779, imposed by the Processor Utilization Rule. Therefore,
this task set is guaranteed to be schedulable using RMS.
@subsection First Deadline Rule
@subsubsection First Deadline Rule
@cindex RMS First Deadline Rule
@@ -386,7 +384,7 @@ deletes itself. This technique ensures that all tasks begin to
compete for execution time at the same instant -- when the user
initialization task deletes itself.
@subsection First Deadline Rule Example
@subsubsection First Deadline Rule Example
The First Deadline Rule can ensure schedulability
even when the Processor Utilization Rule fails. The example
@@ -565,7 +563,7 @@ time 200. Thus, all of the tasks have met their first deadlines
at time 200, and the task set is schedulable using the First
Deadline Rule.
@subsection Relaxation of Assumptions
@subsubsection Relaxation of Assumptions
The assumptions used to develop the RMS
schedulability rules are uncommon in most real-time systems.
@@ -603,7 +601,7 @@ Every hardware and software factor which impacts the execution
time of each task must be accounted for in the schedulability
analysis.
@subsection Further Reading
@subsubsection Further Reading
For more information on Rate Monotonic Scheduling and
its schedulability analysis, the reader is referred to the
@@ -625,8 +623,6 @@ Theory and Ada." @b{IEEE Computer}. April 1990. pp. 53-62.}
review." @b{Software Engineering Journal}. May 1991. pp. 116-128.}
@end itemize
@raisesections
@section Operations
@subsection Creating a Rate Monotonic Period