<?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>http://www.alper.net/ &#187; Algorithms</title>
	<atom:link href="http://www.alper.net/category/programming/algorithms-programming-2/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.alper.net</link>
	<description>Eyup Alper Yoney</description>
	<lastBuildDate>Mon, 27 Jun 2011 07:48:21 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.2.1</generator>
		<item>
		<title>Peterson’s Solution on Modern Multiprocessors</title>
		<link>http://www.alper.net/hardware/peterson%e2%80%99s-solution-on-modern-multiprocessors/</link>
		<comments>http://www.alper.net/hardware/peterson%e2%80%99s-solution-on-modern-multiprocessors/#comments</comments>
		<pubDate>Wed, 17 Mar 2010 20:36:43 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Hardware]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Unix/Linux]]></category>
		<category><![CDATA[Cache]]></category>
		<category><![CDATA[Peterson's Solution]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=498</guid>
		<description><![CDATA[I wrote about the Peterson's Solution in one of my previous posts. I gave an example of how the Peterson’s n-Process Protocol can be implemented in C. It is a classical software based solution to the critical section problem. It isn't desirable to implement on modern systems since it wastes CPU time (busy waiting). In [...]]]></description>
		<wfw:commentRss>http://www.alper.net/hardware/peterson%e2%80%99s-solution-on-modern-multiprocessors/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>Programming Challenges</title>
		<link>http://www.alper.net/programming/programming-challenges/</link>
		<comments>http://www.alper.net/programming/programming-challenges/#comments</comments>
		<pubDate>Sun, 27 Dec 2009 12:47:13 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=224</guid>
		<description><![CDATA[I discovered a new website while I was reading 'The Algorithm Design Manual' from Steve Skiena (I have read only one chapter so far. However, I can say it is worth to read all). On that website, You can find hundreds of problems that are like the ones used during programming contests. You can submit [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/programming-challenges/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Peterson&#8217;s n-Process Protocol</title>
		<link>http://www.alper.net/programming/petersons-n-process-protocol/</link>
		<comments>http://www.alper.net/programming/petersons-n-process-protocol/#comments</comments>
		<pubDate>Sat, 19 Dec 2009 12:53:36 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Peterson's Solution]]></category>

		<guid isPermaLink="false">http://www.alper.net/?p=171</guid>
		<description><![CDATA[Peterson's Solution is a classic software based solution to the critical-section problem. Peterson's original formulations works for 2 processes. However, it is possible to implement it for more than 2 processes. The following code works for 2 processes and it can be found easily on the Internet. #define FALSE &#160;0 #define TRUE &#160; 1 int [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/petersons-n-process-protocol/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Tower of Hanoi</title>
		<link>http://www.alper.net/programming/tower-of-hanoi/</link>
		<comments>http://www.alper.net/programming/tower-of-hanoi/#comments</comments>
		<pubDate>Sun, 16 Mar 2008 15:24:31 +0000</pubDate>
		<dc:creator>Alper</dc:creator>
				<category><![CDATA[Algorithms]]></category>
		<category><![CDATA[C/C++]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Hanoi]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[Tower of Hanoi]]></category>

		<guid isPermaLink="false">http://www.alper.net/programming/tower-of-hanoi/</guid>
		<description><![CDATA[The tower of Hanoi is a mathematical game invented by French mathematician Edouard Lucas in 1883. We are given a tower of eight disks, initially stacked in decreasing size on one of three pegs. The objective is to transfer entire tower A to the peg B, moving only one disk at a time and never [...]]]></description>
		<wfw:commentRss>http://www.alper.net/programming/tower-of-hanoi/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

