Mat am 16. Dezember 2016 um 15:36 Uhr

2016-12-16T15:36:21Z

Mat: Created page with "== Functional Description == The Round-Robin scheduler is the most simplest scheduling algorithm. The scheduler is called periodically and circles through a list of running task..."

2013-05-21T01:31:49Z

Created page with "== Functional Description == The Round-Robin scheduler is the most simplest scheduling algorithm. The scheduler is called periodically and circles through a list of running task..."

Neue Seite

== Functional Description ==

The Round-Robin scheduler is the most simplest scheduling algorithm. The scheduler is called periodically and circles through a list of running tasks, switching from one to the next task each call.
The algorithm can be enhanced by using different weights for each task, the scheduler waits for the next switch the periods given by the weight.

== Task Queues ==

The task queue is organized as a FIFO-list, tasks are taken from the head and are inserted at the tail of the list.

== Software Interrupts ==

When a software interrupt occurs, if needed, the scheduler resumes (puts on the running list) the corresponding event task, remembers the currently executed task and switches the context from the currently executed task to the event task. After the event task has finished (gets suspended) or its time slot is over, the scheduler switches back to the previously interrupted task and continues to schedule normally.

== Usage ==

Configure to use round-robin scheduling (system default):
<pre>
Const Os_scheduling_policy = Os_s
</pre>

[[Category:ChronOS]]

@@ Zeile 1: / Zeile 1: @@
 == Functional Description ==
 The Round-Robin scheduler is the most simplest scheduling algorithm. The scheduler is called periodically and circles through a list of running tasks, switching from one to the next task each call.
-The algorithm can be enhanced by using different weights for each task, the scheduler waits for the next switch the periods given by the weight.
+The algorithm offers some control over the CPU time distribution by using different weights for each task, the scheduler waits for the next context switch the periods given by the weight.
@@ Zeile 10: / Zeile 12: @@
-== Software Interrupts ==
+== Task events ==
-When a software interrupt occurs, if needed, the scheduler resumes (puts on the running list) the corresponding event task, remembers the currently executed task and switches the context from the currently executed task to the event task. After the event task has finished (gets suspended) or its time slot is over, the scheduler switches back to the previously interrupted task and continues to schedule normally.
+When a task event (software interrupt) occurs, if needed, the scheduler resumes (puts on the running list) the corresponding event task, remembers the current list position and switches the context to the event task.
@@ Zeile 19: / Zeile 21: @@
 Configure to use round-robin scheduling (system default):
 <pre>
-Const Os_scheduling_policy = Os_s
+Const Os_scheduling_policy = Os_sched_policy_wrrobin
 </pre>
 [[Category:ChronOS]]

ChronOS Scheduler: Weigthed Round-Robin - Versionsgeschichte

Mat am 16. Dezember 2016 um 15:36 Uhr

Mat: Created page with "== Functional Description == The Round-Robin scheduler is the most simplest scheduling algorithm. The scheduler is called periodically and circles through a list of running task..."