<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title>  Bartosz Milewski&#039;s Programming Cafe</title>
	<atom:link href="http://bartoszmilewski.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://bartoszmilewski.wordpress.com</link>
	<description>Concurrency, Multicore, C++, Haskell</description>
	<lastBuildDate>Wed, 25 Jan 2012 09:58:42 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
<cloud domain='bartoszmilewski.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://s2.wp.com/i/buttonw-com.png</url>
		<title>  Bartosz Milewski&#039;s Programming Cafe</title>
		<link>http://bartoszmilewski.wordpress.com</link>
	</image>
	<atom:link rel="search" type="application/opensearchdescription+xml" href="http://bartoszmilewski.wordpress.com/osd.xml" title="  Bartosz Milewski&#039;s Programming Cafe" />
	<atom:link rel='hub' href='http://bartoszmilewski.wordpress.com/?pushpress=hub'/>
		<item>
		<title>The Day the LOLcats Laughed</title>
		<link>http://bartoszmilewski.wordpress.com/2012/01/23/the-day-the-lolcats-laughed/</link>
		<comments>http://bartoszmilewski.wordpress.com/2012/01/23/the-day-the-lolcats-laughed/#comments</comments>
		<pubDate>Mon, 23 Jan 2012 17:51:58 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[internet crowd]]></category>
		<category><![CDATA[recording industry association of america]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2250</guid>
		<description><![CDATA[I don&#8217;t know about you, but I feel like we have just witnessed the beginning of a new era. The Internet stood up to Congress and to the Senate and won. We have defeated SOPA and PIPA. Big corporations represented by MPAA (Motion Picture Association of America) and RIAA (Recording Industry Association of America) sponsored [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2250&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2012/01/23/the-day-the-lolcats-laughed/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>

		<media:content url="http://bartoszmilewski.files.wordpress.com/2012/01/mmact.png" medium="image">
			<media:title type="html">Mickey Mouse Protection Act</media:title>
		</media:content>
	</item>
		<item>
		<title>Virtual Machines: The Traps and The Thin Hypervisor</title>
		<link>http://bartoszmilewski.wordpress.com/2012/01/03/virtual-machines-the-traps-and-the-thin-hypervisor/</link>
		<comments>http://bartoszmilewski.wordpress.com/2012/01/03/virtual-machines-the-traps-and-the-thin-hypervisor/#comments</comments>
		<pubDate>Wed, 04 Jan 2012 06:00:47 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[hypervisor]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[virtualization]]></category>
		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2221</guid>
		<description><![CDATA[I have released the final part of the series on virtual machines, The Thin Hypervisor. It&#8217;s a very promising technology that allows you to virtualize a running OS on demand. My previous blog entry is a recommended reading before this one. It explains how the hypervisor interacts with the operating system. (You can also follow [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2221&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2012/01/03/virtual-machines-the-traps-and-the-thin-hypervisor/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>2011 in review</title>
		<link>http://bartoszmilewski.wordpress.com/2011/12/31/2011-in-review/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/12/31/2011-in-review/#comments</comments>
		<pubDate>Sun, 01 Jan 2012 02:31:33 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2225</guid>
		<description><![CDATA[The WordPress.com stats helper monkeys prepared a 2011 annual report for this blog. Here&#8217;s an excerpt: The Louvre Museum has 8.5 million visitors per year. This blog was viewed about 180,000 times in 2011. If it were an exhibit at the Louvre Museum, it would take about 8 days for that many people to see [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2225&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/12/31/2011-in-review/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>Virtual Machines: Virtualizing Virtual Memory</title>
		<link>http://bartoszmilewski.wordpress.com/2011/12/05/virtual-machines-virtualizing-virtual-memory/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/12/05/virtual-machines-virtualizing-virtual-memory/#comments</comments>
		<pubDate>Mon, 05 Dec 2011 19:00:18 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[hypervisor]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[virtualization]]></category>
		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2217</guid>
		<description><![CDATA[My new blog about virtual machines is out. It gives a peek at the tricks used by hypervisors to fool the operating system into running in a virtual box. I discuss nested page tables, shadow page tables, tracing, hidden page faults, and other interesting goodies. (You can also follow me on Google+, if you search [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2217&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/12/05/virtual-machines-virtualizing-virtual-memory/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>Virtual Memory</title>
		<link>http://bartoszmilewski.wordpress.com/2011/11/28/virtual-memory/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/11/28/virtual-memory/#comments</comments>
		<pubDate>Mon, 28 Nov 2011 19:19:02 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[hypervisor]]></category>
		<category><![CDATA[Multicore]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[virtualization]]></category>
		<category><![CDATA[x86]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2213</guid>
		<description><![CDATA[I started a new series of blogs about virtual machines. It&#8217;s a relatively exotic technology but the ideas behind it are simple. As an introduction, I explained how virtual memory is implemented by the operating system. (You can also follow me on Google+, if you search for Bartosz Milewski.)<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2213&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/11/28/virtual-memory/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>Supercomputing: An Industry in Need of a Revolution</title>
		<link>http://bartoszmilewski.wordpress.com/2011/11/21/supercomputing-an-industry-in-need-of-a-revolution/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/11/21/supercomputing-an-industry-in-need-of-a-revolution/#comments</comments>
		<pubDate>Mon, 21 Nov 2011 18:16:00 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[Chapel]]></category>
		<category><![CDATA[Concurrency]]></category>
		<category><![CDATA[Distributed Programming]]></category>
		<category><![CDATA[Multicore]]></category>
		<category><![CDATA[Multithreading]]></category>
		<category><![CDATA[Parallelism]]></category>
		<category><![CDATA[Supercomputing]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2199</guid>
		<description><![CDATA[How would you like a job in the supercomputing industry? Programming those powerful Ks, Jaguars, Roadrunners, Blue Genes, or gigantic clusters of computers? How inspiring would that be? Not much, according to the luminaries of the field. I went to a panel about the future of supercomputing at SC11, and learned that the future is&#8230; [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2199&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/11/21/supercomputing-an-industry-in-need-of-a-revolution/feed/</wfw:commentRss>
		<slash:comments>25</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>C++11 Concurrency Series: 9. Condition Variables</title>
		<link>http://bartoszmilewski.wordpress.com/2011/11/13/c11-concurrency-series-9-condition-variables/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/11/13/c11-concurrency-series-9-condition-variables/#comments</comments>
		<pubDate>Mon, 14 Nov 2011 01:40:02 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Concurrency]]></category>
		<category><![CDATA[Multithreading]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Tutorial]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2195</guid>
		<description><![CDATA[The latest tutorial is out. I talk in some depth about condition variables and then show how to use them in constructing a message queue. I use the message queue to implement message-passing server threads. (You can also follow me on Google+, if you search for Bartosz Milewski.)<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2195&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/11/13/c11-concurrency-series-9-condition-variables/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>Supercomputing in Seattle</title>
		<link>http://bartoszmilewski.wordpress.com/2011/11/07/supercomputing-in-seattle/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/11/07/supercomputing-in-seattle/#comments</comments>
		<pubDate>Mon, 07 Nov 2011 17:30:58 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[Chapel]]></category>
		<category><![CDATA[Concurrency]]></category>
		<category><![CDATA[Distributed Programming]]></category>
		<category><![CDATA[Multicore]]></category>
		<category><![CDATA[Parallelism]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2178</guid>
		<description><![CDATA[I firmly believe that supercomputing of today is the mainstream computing of tomorrow. A year and a half ago I wrote a blog about the future of concurrent programming based on new developments in systems and languages in the HPC (High-Performance Computing) community. Hopefully, this year I&#8217;ll learn more at the SC11 conference that&#8217;s taking [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2178&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/11/07/supercomputing-in-seattle/feed/</wfw:commentRss>
		<slash:comments>8</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>C++11 Concurrency Series: 8. Data Races</title>
		<link>http://bartoszmilewski.wordpress.com/2011/10/31/c11-concurrency-series-8-data-races/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/10/31/c11-concurrency-series-8-data-races/#comments</comments>
		<pubDate>Mon, 31 Oct 2011 17:47:51 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Concurrency]]></category>
		<category><![CDATA[Multicore]]></category>
		<category><![CDATA[Multithreading]]></category>
		<category><![CDATA[Tutorial]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2174</guid>
		<description><![CDATA[In this tutorial: I summarize safe ways of passing arguments to threads, and their gotchas Show an optimization of monitors based on epochs, together with its maintenance pitfalls Debug the resulting data race (You can also follow me on Google+, if you search for Bartosz Milewski.)<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2174&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/10/31/c11-concurrency-series-8-data-races/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
		<item>
		<title>C++11 Concurrency Tutorial: 7. Mutex, Lock, and Monitor</title>
		<link>http://bartoszmilewski.wordpress.com/2011/10/24/c11-concurrency-tutorial-7-mutex-lock-and-monitor/</link>
		<comments>http://bartoszmilewski.wordpress.com/2011/10/24/c11-concurrency-tutorial-7-mutex-lock-and-monitor/#comments</comments>
		<pubDate>Mon, 24 Oct 2011 18:06:14 +0000</pubDate>
		<dc:creator>Bartosz Milewski</dc:creator>
				<category><![CDATA[C++]]></category>
		<category><![CDATA[Concurrency]]></category>
		<category><![CDATA[Multicore]]></category>
		<category><![CDATA[Multithreading]]></category>
		<category><![CDATA[Parallelism]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[Tutorial]]></category>

		<guid isPermaLink="false">http://bartoszmilewski.wordpress.com/?p=2153</guid>
		<description><![CDATA[Why did I do six concurrency tutorials without mentioning mutexes? I think people resort to explicit locking much too early. In this installment I compare two implementations side by side and the results might be surprising. One is moving data between threads (the new C++11 move semantics), the other is using a shared monitor. Whatever [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=bartoszmilewski.wordpress.com&amp;blog=3549518&amp;post=2153&amp;subd=bartoszmilewski&amp;ref=&amp;feed=1" width="1" height="1" />]]></description>
		<wfw:commentRss>http://bartoszmilewski.wordpress.com/2011/10/24/c11-concurrency-tutorial-7-mutex-lock-and-monitor/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
	
		<media:content url="http://0.gravatar.com/avatar/c018f213204496b4bbf481e7c8e6c15c?s=96&#38;d=http%3A%2F%2Fs0.wp.com%2Fi%2Fmu.gif" medium="image">
			<media:title type="html">Bartosz Milewski</media:title>
		</media:content>
	</item>
	</channel>
</rss>
