<?xml version="1.0" encoding="UTF-8" ?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>liblf-dev at Yahoo! Groups</title>
    <link>http://tech.groups.yahoo.com/group/liblf-dev/</link>
    <description>Lockfree data structure implementers</description>

    <item>
      <title>Re: STM in C?</title>
      <pubDate>Sun, 07 Jun 2009 09:11:05 GMT</pubDate>
      <dc:creator>Stephen Sinclair</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/300</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/300</guid>
      <description>Thanks, I didn&#39;t know about either of those!  Glad I asked. :) Steve</description>
    </item>
    <item>
      <title>Res: [liblf-dev] STM in C?</title>
      <pubDate>Sat, 06 Jun 2009 07:53:09 GMT</pubDate>
      <dc:creator>Andrey Brito</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/299</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/299</guid>
      <description>Hello Stephen, For C, I know TinySTM: http://www.tinystm.org/ Regarding the lock-free structures, you can try take a look at:</description>
    </item>
    <item>
      <title>STM in C?</title>
      <pubDate>Sat, 06 Jun 2009 05:31:35 GMT</pubDate>
      <dc:creator>Stephen Sinclair</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/298</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/298</guid>
      <description>Are there any open source libraries implementing software transactional memory in C? Is there a web site anywhere with a list of open source resources for </description>
    </item>
    <item>
      <title>MIT Prof. course on multicore programming</title>
      <pubDate>Fri, 05 Jun 2009 19:03:06 GMT</pubDate>
      <dc:creator>Maurice Herlihy</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/297</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/297</guid>
      <description>Multicore Programming [6.05s] C. Leiserson, M. Herlihy, N. Shavit Multicores are bringing about a paradigm shift in programming. The course exposes students to</description>
    </item>
    <item>
      <title>Re: an implementation of lock-free queue without atomic</title>
      <pubDate>Tue, 31 Mar 2009 18:05:35 GMT</pubDate>
      <dc:creator>Chris Purcell</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/296</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/296</guid>
      <description>The issue that concerns me is the ordering of memory operations on the node pointer and on the node itself. For instance, the write of the node&#39;s address to</description>
    </item>
    <item>
      <title>Re: an implementation of lock-free queue without atomic</title>
      <pubDate>Tue, 31 Mar 2009 07:29:10 GMT</pubDate>
      <dc:creator>Roman Dion</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/295</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/295</guid>
      <description>I&#39;m very sorry that I can not find my posted reply in this groups , this is third time .why ? ... Thank you ,  Chris .  Sorry for my poor english , I will try</description>
    </item>
    <item>
      <title>Re: an implementation of lock-free queue without atomic</title>
      <pubDate>Tue, 31 Mar 2009 07:29:10 GMT</pubDate>
      <dc:creator>romandion78</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/294</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/294</guid>
      <description>... Thank you ,  Chris .  Sorry for my poor english , I will try my best to express my own opinion . It is true that  I don&#39;t use any memory barriers  in my</description>
    </item>
    <item>
      <title>Re: an implementation of lock-free queue without atomic</title>
      <pubDate>Thu, 26 Mar 2009 11:13:43 GMT</pubDate>
      <dc:creator>Chris Purcell</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/293</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/293</guid>
      <description>There don&#39;t appear to be any memory barriers in your code. How are you avoiding the issue of out-of-order execution on multiprocessor machines? Chris</description>
    </item>
    <item>
      <title>an implementation of lock-free queue without atomic</title>
      <pubDate>Thu, 26 Mar 2009 08:59:09 GMT</pubDate>
      <dc:creator>romandion78</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/292</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/292</guid>
      <description>I have an idea about lock-free queue without atomic , you can find source code at http://code.google.com/p/liblfqueue/downloads/list . Any body can send email</description>
    </item>
    <item>
      <title>Re: Lock-free ring buffer memory barriers test case</title>
      <pubDate>Thu, 06 Nov 2008 15:18:53 GMT</pubDate>
      <dc:creator>Bjorn Roche</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/291</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/291</guid>
      <description>There are two files in the file section of this list. I scanned the emails of this list quickly and I think they both ran fine for many people and failed for</description>
    </item>
    <item>
      <title>Re: Lock-free ring buffer memory barriers test case</title>
      <pubDate>Thu, 06 Nov 2008 06:57:07 GMT</pubDate>
      <dc:creator>Stephen Sinclair</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/290</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/290</guid>
      <description>Hello, I just saw this postedon reddit, I&#39;m not sure but I thought it might be relevant to this discussion. </description>
    </item>
    <item>
      <title>Re: Lock-free ring buffer memory barriers test case</title>
      <pubDate>Sat, 01 Nov 2008 06:17:19 GMT</pubDate>
      <dc:creator>oja_i_i</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/289</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/289</guid>
      <description>... I&#39;ve read so many citations, and other theories about ring buffers and memory barriers. But to me they&#39;re useless until someone can write a piece of code</description>
    </item>
    <item>
      <title>Re: Lock-free ring buffer memory barriers test case</title>
      <pubDate>Sat, 01 Nov 2008 06:17:13 GMT</pubDate>
      <dc:creator>Stephen Sinclair</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/288</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/288</guid>
      <description>... Even with -O0? Steve</description>
    </item>
    <item>
      <title>Re: Lock-free ring buffer memory barriers test case</title>
      <pubDate>Sat, 01 Nov 2008 06:15:23 GMT</pubDate>
      <dc:creator>Ross Bencina</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/287</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/287</guid>
      <description>I don&#39;t think so either. I&#39;d be surprised if gcc inserts any memory barriers. But I do remember reading somewhere that a C optimizer probably won&#39;t reorder</description>
    </item>
    <item>
      <title>Re: Lock-free ring buffer memory barriers test case</title>
      <pubDate>Fri, 31 Oct 2008 14:34:12 GMT</pubDate>
      <dc:creator>Bjorn Roche</dc:creator>
      <link>http://tech.groups.yahoo.com/group/liblf-dev/message/286</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/liblf-dev/message/286</guid>
      <description>... I can&#39;t find a citation right now, so I could be wrong. If I am wrong, sorry about that. It&#39;s obviously not behavior to count on anway, since even if you</description>
    </item>

  </channel>
</rss>
<!-- wr2.grp.sp2.yahoo.com uncompressed/chunked Fri Dec  4 06:00:50 PST 2009 -->
