<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Kenneth Ham &#187; Open Source</title>
	<atom:link href="http://www.kennethham.com/wp/category/open-source/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.kennethham.com/wp</link>
	<description></description>
	<lastBuildDate>Mon, 23 Jan 2012 15:55:10 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.5</generator>
		<item>
		<title>CPU Scheduling Simulation</title>
		<link>http://www.kennethham.com/wp/2008/11/cpu-scheduling-simulation/</link>
		<comments>http://www.kennethham.com/wp/2008/11/cpu-scheduling-simulation/#comments</comments>
		<pubDate>Sat, 08 Nov 2008 10:00:33 +0000</pubDate>
		<dc:creator>kham</dc:creator>
				<category><![CDATA[Open Source]]></category>
		<category><![CDATA[School]]></category>
		<category><![CDATA[VB .net]]></category>
		<category><![CDATA[ZedGraph API]]></category>

		<guid isPermaLink="false">http://kham.wordpress.com/?p=18</guid>
		<description><![CDATA[This application allows you to analyze different CPU scheduling algorithms. It currently uses 3 non preemptive algorithms (first in first out, shortest job next, non preemptive priority) and 3 preemptive algorithms (round robin, shortest time remaining, preemptive priority). I designed this application so that additional algorithms can be added in and analyzed alongside the built-in [...]]]></description>
			<content:encoded><![CDATA[<p>This application allows you to analyze different CPU scheduling algorithms. It currently uses 3 non preemptive algorithms (first in first out, shortest job next, non preemptive priority) and 3 preemptive algorithms (round robin, shortest time remaining, preemptive priority). I designed this application so that additional algorithms can be added in and analyzed alongside the built-in algorithms. Within the interface, you can generate random processes, create/edit your own processes, change the round robin time quantum, set all arrival times to 0, and save/load a set of processes.</p>
<p>Here is an early sketch I made for this application to help plan its implementation:</p>
<div id="attachment_19" class="wp-caption aligncenter" style="width: 310px"><a href="http://kham.files.wordpress.com/2008/11/framework.gif"><img src="http://kham.files.wordpress.com/2008/11/framework.gif?w=300" alt="Early schematic for CPU scheduling program" title="framework" width="300" height="230" class="size-medium wp-image-19" /></a><p class="wp-caption-text">Early schematic for CPU scheduling program</p></div>
<p>Here is a screenshot of the working application:</p>
<div id="attachment_169" class="wp-caption aligncenter" style="width: 241px"><a href="http://kham.files.wordpress.com/2008/11/cpu.jpg"><img src="http://kham.files.wordpress.com/2008/11/cpu.jpg?w=231" alt="CPU Scheduling Interface" title="CPU UI" width="231" height="300" class="size-medium wp-image-169" /></a><p class="wp-caption-text">CPU Scheduling Interface</p></div>
<p>The graph control used in this project is an open source C# control called <a href="http://zedgraph.sourceforge.net/">ZedGraph.</a></p>
<p>This program is open source and is currently hosted on sourceforge.net at <a href="https://sourceforge.net/projects/cpuschedulingsi/">https://sourceforge.net/projects/cpuschedulingsi/</a>.</p>
<p><strong>Download here:</strong>  <a href="http://kennethaham.googlepages.com/SchedulingSimulator.zip">SchedulingSimulator.zip</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.kennethham.com/wp/2008/11/cpu-scheduling-simulation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

