Hi people, While I was implementing multi-word CAS, I used memory pool for those operation descriptors (of DCSS/CCAS and MCAS). The memory reclamation ...
Hi guys, Michael & Scott's algorithm works instead. The important assumption is nodes in free pool(stack) must have refct_claimbit as 1! Sorry for the ...
I am not sure if some people had evaluated Michael&Scott's memory reclamation (RC), Michael's Hazard Point, against Herlihy's ROP Pass-the-Buck. My initial...
Pass-the-Buck requires a hardware primitive not avalable on many platforms (DWCAS). Michael's SMR requires only reads and writes (and memory barriers for...
... Yes the original PTB algo requires DCAS which as Chris pointed out available on almost none modern chips; there is an "alternative" algo, however, which...
hi all, did someone on this list already have a look at securuslib (http://www.securuslib.com/)? best, tim -- tim@... http://tim.klingt.org The composer...
Hey all, I just wanted to update everyone on the latest developments in C++0x (hopefully that will be C++08!). Lawrence Crowl, one of the members of the...
hi all, i have been releasing some c++ implementations of lock-free data structures under a boost-style license ... maybe some of this code is interesting for...
Hey all, I've been using Threading Building Blocks for the past year, and I'm very happy with it. Lately I have been researching wait-free algorithms, and...
Hi Bjorn, I'm learning about what's available in different compilers in the way of atomic compare and swap (and other operations). Are you still working on...
Hey Reed, I haven't even looked at this stuff in forever, but I'm happy to revisit if there's interest. I think the idea of some simple datastructures is a...
Sorry I missed the licensing question. I don't want to lock down to GPL either, but I am happy to be compatible with it. My understanding has always been that...
Hello, This seemed like an appropriate place for this question. This is quite random, but I am emailing because I was wondering if I could get your opinion on...
Hello Stephen, if this review you've got were right, there wouldn't exist lock-free algorithms, as the bases for lock-freedom are compare-and-swap and...
Andrey, Thanks a lot for your response, it gives me some confidence! :) Also, I'll take a good look at that reference. I found this list because I was looking...
You could use the terminology 'wait-free' instead to transcend the issue? Though it seems that your reviewer is wrongfully assigning purpose of TAS to locks,...
On Fri, Sep 26, 2008 at 2:12 PM, Graham Wakefield ... Yes, I only read recently that there is a subtle difference in the semantics of wait-free and lock-free....
Hi, Can any of you advise a good test case that would demonstrate memory barriers are needed in a lock-free ring buffer ? I mean: a piece of code that would...
Many optimizing compilers will make things work, not because they should work, but because optimizers like to remove operations and that tends to make things...
... Thanks for your answer. Is this the counter example you mention: http://tech.groups.yahoo.com/group/liblf-dev/message/203 ? -- Olivier Guilyardi / Samalyse...
... Gosh that's hard to read without the tabs! I think that was just a standard ringbuffer, not a proof that memory barriers are needed design. bjorn ... Bjorn...
... I can't find a citation right now, so I could be wrong. If I am wrong, sorry about that. It's obviously not behavior to count on anway, since even if you...
I don't think so either. I'd be surprised if gcc inserts any memory barriers. But I do remember reading somewhere that a C optimizer probably won't reorder...
... I've read so many citations, and other theories about ring buffers and memory barriers. But to me they're useless until someone can write a piece of code...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
