Changeset 5ab8aef in rtems
- Timestamp:
- 03/15/02 19:03:52 (21 years ago)
- Branches:
- 4.10, 4.11, 4.8, 4.9, 5, master
- Children:
- 293c0e30
- Parents:
- dee576c0
- Location:
- doc/user
- Files:
-
- 2 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/user/ChangeLog
rdee576c0 r5ab8aef 1 2002-03-15 Eric Norum <eric.norum@usask.ca> 2 3 * rtmon.t: Correct example and correctly used ensure not insure. 4 1 5 2002-01-18 Ralf Corsepius <corsepiu@faw.uni-ulm.de> 2 6 -
doc/user/rtmon.t
rdee576c0 r5ab8aef 38 38 manage the execution of periodic tasks. This manager was 39 39 designed to support application designers who utilize the Rate 40 Monotonic Scheduling Algorithm (RMS) to insure that their40 Monotonic Scheduling Algorithm (RMS) to ensure that their 41 41 periodic tasks will meet their deadlines, even under transient 42 42 overload conditions. Although designed for hard real-time … … 83 83 sporadic task could be used to process the pressing of a fire 84 84 button on a joystick. The mechanical action of the fire button 85 insures a minimum time period between successive activations,85 ensures a minimum time period between successive activations, 86 86 but the missile must be launched by a hard deadline. 87 87 … … 211 211 @cindex RMS schedulability analysis 212 212 213 RMS allows application designers to insure that tasks213 RMS allows application designers to ensure that tasks 214 214 can meet all deadlines, even under transient overload, without 215 215 knowing exactly when any given task will execute by applying … … 265 265 @end example 266 266 267 To insure schedulability even under transient267 To ensure schedulability even under transient 268 268 overload, the processor utilization must adhere to the following 269 269 rule: … … 380 380 are assumed to start at the exact same instant in time. 381 381 Although this assumption may seem to be invalid, RTEMS makes it 382 quite easy to insure. By having a non-preemptible user382 quite easy to ensure. By having a non-preemptible user 383 383 initialization task, all application tasks, regardless of 384 384 priority, can be created and started before the initialization 385 deletes itself. This technique insures that all tasks begin to385 deletes itself. This technique ensures that all tasks begin to 386 386 compete for execution time at the same instant -- when the user 387 387 initialization task deletes itself. … … 389 389 @subsection First Deadline Rule Example 390 390 391 The First Deadline Rule can insure schedulability391 The First Deadline Rule can ensure schedulability 392 392 even when the Processor Utilization Rule fails. The example 393 393 below is a modification of the Processor Utilization Rule … … 716 716 @page 717 717 @example 718 rtems_task Periodic_task( )718 rtems_task Periodic_task(rtems_task_argument arg) 719 719 @{ 720 720 rtems_name name; … … 778 778 @page 779 779 @example 780 task Periodic_task()780 rtems_task Periodic_task(rtems_task_argument arg) 781 781 @{ 782 782 rtems_name name_1, name_2; … … 837 837 tick period established by period_1. The 838 838 @code{@value{DIRPREFIX}rate_monotonic_cancel( period_2 )} 839 call is performed to insure that the period_2 period839 call is performed to ensure that the period_2 period 840 840 does not expire while the task is blocked on the period_1 841 841 period. If this cancel operation were not performed, every time 842 the @code{@value{DIRPREFIX}rate_monotonic_period( period_ 1, 40 )}842 the @code{@value{DIRPREFIX}rate_monotonic_period( period_2, 40 )} 843 843 call is executed, except for the initial one, a directive status 844 844 of @code{@value{RPREFIX}TIMEOUT} is returned. It is important to 845 note that every time this call is made, the period_ 1period will be845 note that every time this call is made, the period_2 period will be 846 846 initiated immediately and the task will not block. 847 847
Note: See TracChangeset
for help on using the changeset viewer.