<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.0.12-alpha" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments on: Transactions Everywhere</title>
	<link>http://www.lshift.net/blog/2005/09/26/transactions-everywhere</link>
	<description>What happens at LShift</description>
	<pubDate>Sat, 11 Oct 2008 11:17:33 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.0.12-alpha</generator>

	<item>
		<title>by: matthias</title>
		<link>http://www.lshift.net/blog/2005/09/26/transactions-everywhere#comment-13</link>
		<pubDate>Tue, 11 Oct 2005 09:37:19 +0000</pubDate>
		<guid>http://www.lshift.net/blog/2005/09/26/transactions-everywhere#comment-13</guid>
					<description>&lt;p&gt;While STM operations are cheap compared to other methods for controlling access to shared data in a multi-threaded system, they are still substantially more expensive than straightforward memory access. However, only shared, mutable storage needs STM semantics and incur the cost of STM operations.&lt;/p&gt;

&lt;p&gt;It thus follows that STMs are only suitable as a memory model for languages where mutation and sharing is rare and static program analysis can easily determine where it takes place.&lt;/p&gt;

&lt;p&gt;This makes languages like Haskell - with its pure functional characteristics guaranteed by the type system - ideal candidates for STM implementations.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>While STM operations are cheap compared to other methods for controlling access to shared data in a multi-threaded system, they are still substantially more expensive than straightforward memory access. However, only shared, mutable storage needs STM semantics and incur the cost of STM operations.</p>
<p>It thus follows that STMs are only suitable as a memory model for languages where mutation and sharing is rare and static program analysis can easily determine where it takes place.</p>
<p>This makes languages like Haskell - with its pure functional characteristics guaranteed by the type system - ideal candidates for STM implementations.</p>
]]></content:encoded>
				</item>
	<item>
		<title>by: matthias</title>
		<link>http://www.lshift.net/blog/2005/09/26/transactions-everywhere#comment-11</link>
		<pubDate>Thu, 29 Sep 2005 15:35:29 +0000</pubDate>
		<guid>http://www.lshift.net/blog/2005/09/26/transactions-everywhere#comment-11</guid>
					<description>&lt;p&gt;There is one other, rather important question &lt;em&gt;Are STMs the right abstraction?&lt;/em&gt; The literature suggests that they really only work well in shared memory architectures, and when there is little contention.&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>There is one other, rather important question <em>Are STMs the right abstraction?</em> The literature suggests that they really only work well in shared memory architectures, and when there is little contention.</p>
]]></content:encoded>
				</item>
</channel>
</rss>
