<?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>Persistent notes &#187; multithreading</title>
	<atom:link href="http://alexkr.com/tag/multithreading/feed/" rel="self" type="application/rss+xml" />
	<link>http://alexkr.com</link>
	<description>Alexander Krivutsenko&#039;s online journal</description>
	<lastBuildDate>Sat, 07 Apr 2012 20:46:40 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Iterating a map in ACE</title>
		<link>http://alexkr.com/posts/138/iterating-a-map-in-ace/</link>
		<comments>http://alexkr.com/posts/138/iterating-a-map-in-ace/#comments</comments>
		<pubDate>Tue, 22 Apr 2008 16:55:05 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[short]]></category>
		<category><![CDATA[ace]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[multithreading]]></category>

		<guid isPermaLink="false">http://alexkr.com/posts/138/iterating-a-map-in-ace/</guid>
		<description><![CDATA[STL containers are not thread safe but ACE containers support synchronization.
Consider you are using containers like std::map in multi threaded environment.
Normally there must be a critical section or a mutex which protects access to the container.
STL implementations do not provide such mechanism by default so C++ programmers must implement it.
ACE library has very flexible way [...]]]></description>
		<wfw:commentRss>http://alexkr.com/posts/138/iterating-a-map-in-ace/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Non blocking stack</title>
		<link>http://alexkr.com/source-code/119/non-blocking-stack/</link>
		<comments>http://alexkr.com/source-code/119/non-blocking-stack/#comments</comments>
		<pubDate>Tue, 04 Sep 2007 12:27:28 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[multithreading]]></category>

		<guid isPermaLink="false">http://alexkr.com/source-code/119/non-blocking-stack/</guid>
		<description><![CDATA[Non blocking algorithms are based on the idea that processor hardware can provide a way to implement some thread unsafe operations in an atomic way. Usually only few such operations are needed to implement non blocking data container.
On Intel platform Windows API provides implementation of interlocked functions which perform thread unsafe operations in an atomic [...]]]></description>
		<wfw:commentRss>http://alexkr.com/source-code/119/non-blocking-stack/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Avoiding deadlocks with ACE_Reactor</title>
		<link>http://alexkr.com/posts/73/avoiding-deadlocks-with-ace_reactor/</link>
		<comments>http://alexkr.com/posts/73/avoiding-deadlocks-with-ace_reactor/#comments</comments>
		<pubDate>Wed, 10 Jan 2007 16:01:34 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[short]]></category>
		<category><![CDATA[ace]]></category>
		<category><![CDATA[multithreading]]></category>

		<guid isPermaLink="false">http://alexkr.com/programming/73/avoiding-deadlocks-with-ace_reactor/</guid>
		<description><![CDATA[ACE_Reactor uses mutex to sync timer handling]]></description>
		<wfw:commentRss>http://alexkr.com/posts/73/avoiding-deadlocks-with-ace_reactor/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>When single threaded is good</title>
		<link>http://alexkr.com/posts/56/when-single-threaded-is-good/</link>
		<comments>http://alexkr.com/posts/56/when-single-threaded-is-good/#comments</comments>
		<pubDate>Mon, 03 Jul 2006 16:13:31 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[short]]></category>
		<category><![CDATA[multithreading]]></category>

		<guid isPermaLink="false">http://alexkr.com/algorithms-and-data/56/when-single-threaded-is-good/</guid>
		<description><![CDATA[When single threaded applications are not worse than multithreaded]]></description>
		<wfw:commentRss>http://alexkr.com/posts/56/when-single-threaded-is-good/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Mutex versus Critical Section</title>
		<link>http://alexkr.com/posts/27/mutex-versus-critical-section/</link>
		<comments>http://alexkr.com/posts/27/mutex-versus-critical-section/#comments</comments>
		<pubDate>Wed, 02 Nov 2005 16:28:10 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[short]]></category>
		<category><![CDATA[multithreading]]></category>

		<guid isPermaLink="false">http://alexkr.com/windows/27/mutex-versus-critical-section/</guid>
		<description><![CDATA[What is the difference between Mutexes and Critical Sections]]></description>
		<wfw:commentRss>http://alexkr.com/posts/27/mutex-versus-critical-section/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>IO Completion ports</title>
		<link>http://alexkr.com/posts/20/io-completion-ports/</link>
		<comments>http://alexkr.com/posts/20/io-completion-ports/#comments</comments>
		<pubDate>Tue, 20 Sep 2005 06:56:43 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[short]]></category>
		<category><![CDATA[c]]></category>
		<category><![CDATA[multithreading]]></category>
		<category><![CDATA[windows]]></category>

		<guid isPermaLink="false">http://alexkr.com/windows/network/20/io-completion-ports/</guid>
		<description><![CDATA[It is possible to use IOCP with sockets]]></description>
		<wfw:commentRss>http://alexkr.com/posts/20/io-completion-ports/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Non blocking singly linked list</title>
		<link>http://alexkr.com/memos/16/non-blocking-singly-linked-list/</link>
		<comments>http://alexkr.com/memos/16/non-blocking-singly-linked-list/#comments</comments>
		<pubDate>Mon, 12 Sep 2005 05:47:53 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[c]]></category>
		<category><![CDATA[cpp]]></category>
		<category><![CDATA[multithreading]]></category>
		<category><![CDATA[windows]]></category>

		<guid isPermaLink="false">http://alexkr.com/windows/16/non-blocking-singly-linked-list/</guid>
		<description><![CDATA[With the help of non blocking algorithms it is possible to manage IPC more effeciently without blocking the threads when a shared resource needs to be accessed simalteneously.
One of the well known non blocking algorithms is based on atomic operations on pointers.
It allows multiple threads to access a singly linked list.

Win32 API on Windows XP [...]]]></description>
		<wfw:commentRss>http://alexkr.com/memos/16/non-blocking-singly-linked-list/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>

