Committed. Thanks for the detailed read and fixes.
--joel
On Fri, May 15, 2020 at 7:10 PM Richi Dubey wrote:
> ---
> c-user/scheduling_concepts.rst | 50 +-
> 1 file changed, 25 insertions(+), 25 deletions(-)
>
> diff --git a/c-user/scheduling_concepts.rst
> b/c-user/scheduling_concepts.rst
> index dac39a8..d329bc4 100644
> --- a/c-user/scheduling_concepts.rst
> +++ b/c-user/scheduling_concepts.rst
> @@ -16,7 +16,7 @@ Introduction
>
>
> The concept of scheduling in real-time systems dictates the ability to
> provide
> -immediate response to specific external events, particularly the
> necessity of
> +an immediate response to specific external events, particularly the
> necessity of
> scheduling tasks to run within a specified time limit after the
> occurrence of
> an event. For example, software embedded in life-support systems used to
> monitor hospital patients must take instant action if a change in the
> patient's
> @@ -38,7 +38,7 @@ The directives provided by the scheduler manager are:
> - rtems_scheduler_get_maximum_priority_ - Get maximum task priority of a
> scheduler
>
> - rtems_scheduler_map_priority_to_posix_ - Map task priority to POSIX
> thread
> - prority
> + priority
>
> - rtems_scheduler_map_priority_from_posix_ - Map POSIX thread priority to
> task
>prority
> @@ -58,8 +58,8 @@ The directives provided by the scheduler manager are:
> Scheduling Algorithms
> -
>
> -RTEMS provides a plugin framework which allows it to support multiple
> -scheduling algorithms. RTEMS includes multiple scheduling algorithms and
> the
> +RTEMS provides a plugin framework that allows it to support multiple
> +scheduling algorithms. RTEMS includes multiple scheduling algorithms, and
> the
> user can select which of these they wish to use in their application at
> link-time. In addition, the user can implement their own scheduling
> algorithm
> and configure RTEMS to use it.
> @@ -69,8 +69,8 @@ select the algorithm which is most appropriate to their
> use case. Most
> real-time operating systems schedule tasks using a priority based
> algorithm,
> possibly with preemption control. The classic RTEMS scheduling algorithm
> which
> was the only algorithm available in RTEMS 4.10 and earlier, is a
> fixed-priority
> -scheduling algorithm. This scheduling algoritm is suitable for
> uniprocessor
> -(e.g. non-SMP) systems and is known as the *Deterministic Priority
> +scheduling algorithm. This scheduling algorithm is suitable for
> uniprocessor
> +(e.g., non-SMP) systems and is known as the *Deterministic Priority
> Scheduler*. Unless the user configures another scheduling algorithm,
> RTEMS
> will use this on uniprocessor systems.
>
> @@ -87,7 +87,7 @@ in time is the one with the highest priority among all
> tasks in the ready
> state.
>
> When a task is added to the ready chain, it is placed behind all other
> tasks of
> -the same priority. This rule provides a round-robin within priority group
> +the same priority. This rule provides a round-robin within a priority
> group
> scheduling characteristic. This means that in a group of equal priority
> tasks,
> tasks will execute in the order they become ready or FIFO order. Even
> though
> there are ways to manipulate and adjust task priorities, the most
> important
> @@ -100,7 +100,7 @@ rule to remember is:
>
> Priority scheduling is the most commonly used scheduling algorithm. It
> should
> be used by applications in which multiple tasks contend for CPU time or
> other
> -resources and there is a need to ensure certain tasks are given priority
> over
> +resources, and there is a need to ensure certain tasks are given priority
> over
> other tasks.
>
> There are a few common methods of accomplishing the mechanics of this
> @@ -127,7 +127,7 @@ algorithm. These ways involve a list or chain of
> tasks in the ready state.
>the ready queue.
>
> RTEMS currently includes multiple priority based scheduling algorithms as
> well
> -as other algorithms which incorporate deadline. Each algorithm is
> discussed in
> +as other algorithms that incorporate deadline. Each algorithm is
> discussed in
> the following sections.
>
> Uniprocessor Schedulers
> @@ -142,13 +142,13 @@ Deterministic Priority Scheduler
>
>
> This is the scheduler implementation which has always been in RTEMS.
> After the
> -4.10 release series, it was factored into pluggable scheduler selection.
> It
> +4.10 release series, it was factored into a pluggable scheduler
> selection. It
> schedules tasks using a priority based algorithm which takes into account
> preemption. It is implemented using an array of FIFOs with a FIFO per
> priority. It maintains a bitmap which is used to track which priorities
> have
> ready tasks.
>
> -This algorithm is deterministic (e.g. predictable and fixed) in execution
> time.
> +This algorithm is deterministic (e.g., predic
