<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
	<id>https://mat.midlight.eu/index.php?action=history&amp;feed=atom&amp;title=ChronOS_Scheduling_Strategies</id>
	<title>ChronOS Scheduling Strategies - Versionsgeschichte</title>
	<link rel="self" type="application/atom+xml" href="https://mat.midlight.eu/index.php?action=history&amp;feed=atom&amp;title=ChronOS_Scheduling_Strategies"/>
	<link rel="alternate" type="text/html" href="https://mat.midlight.eu/index.php?title=ChronOS_Scheduling_Strategies&amp;action=history"/>
	<updated>2026-06-11T22:38:35Z</updated>
	<subtitle>Versionsgeschichte dieser Seite in ProjectWiki</subtitle>
	<generator>MediaWiki 1.31.0</generator>
	<entry>
		<id>https://mat.midlight.eu/index.php?title=ChronOS_Scheduling_Strategies&amp;diff=9&amp;oldid=prev</id>
		<title>Mat: Created page with &quot;== Round-Robin ==  The Round-Robin strategy is the simplest one and uses very low resources, it just cycles through the (active) tasks in the same order as the tasks are created....&quot;</title>
		<link rel="alternate" type="text/html" href="https://mat.midlight.eu/index.php?title=ChronOS_Scheduling_Strategies&amp;diff=9&amp;oldid=prev"/>
		<updated>2011-05-03T22:39:08Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;== Round-Robin ==  The Round-Robin strategy is the simplest one and uses very low resources, it just cycles through the (active) tasks in the same order as the tasks are created....&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Neue Seite&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Round-Robin ==&lt;br /&gt;
&lt;br /&gt;
The Round-Robin strategy is the simplest one and uses very low resources, it just cycles through the (active) tasks in the same order as the tasks are created.&lt;br /&gt;
Every system tick, a context switch occurs and the next task runs.&lt;br /&gt;
Each task will get the same amount of CPU-time.&lt;br /&gt;
&lt;br /&gt;
== EDF-Based Priorities ==&lt;br /&gt;
&lt;br /&gt;
Each task is assigned with a fixed priority and a time interval.&lt;br /&gt;
&lt;br /&gt;
The EDF-strategy ( Earliest Deadline First) sets the tasks ready that have the lowest free time to reach their interval. If more than one task become the ready-state, the task with the highest priority will be scheduled next.&lt;br /&gt;
&lt;br /&gt;
 If a suspended task reaches its interval, the corresponding PID will be put on the &amp;quot;active&amp;quot; list.&lt;br /&gt;
&lt;br /&gt;
[[Category:ChronOS]]&lt;/div&gt;</summary>
		<author><name>Mat</name></author>
		
	</entry>
</feed>