Hi Tim, This is a lifesaver for me! I wanted to add some lock-free code to a project I'm working on to speed up some critical pieces. Unfortunately, this is all new to me, and I've found it very hard to get something working reliably due to the lack of good, open and portable primitives. Now, I'm throwing out my code and using yours instead! =) One class I put together that others might be interested in is a simple allocator that uses multiple boost::pool<> objects for memory blocks of various sizes, and combines these with caching free lists that makes it lock-free when there is enough memory already available. Not sure how this compares to the lock-free allocation algorithms out there, but it seemed like a simple approach that works perfectly for what I need it for.. http://websvn.atomiclabs.com/filedetails.php?repname=pion-common&path=%2Ftrunk%2Fcommon%2Finclude%2Fpion%2FPionPoolAllocator.hpp (you should be able to easily strip out the "Pion" stuff without any adverse affect) Glad to see lots of support for this library here! Take care, -Mike On Apr 28, 2008, at 11:25 AM, Tim Blechmann wrote:
hi all,
i adapted some of my code to make it available under the boost license, which might be the starting point for a boost.lockfree library ...
the main container is a lockfree fifo, the code is not really structured, yet, nor documented ... also, it is only tested on linux/gcc ...
the a tarball is available at: http://tim.klingt.org/boost_lockfree.tar.bz2
i would be curious, if some people might want to work together in order to implement a boost-style lockfree library ...
cheers, tim
-- tim@klingt.org http://tim.klingt.org
Cheat your landlord if you can and must, but do not try to shortchange the Muse. It cannot be done. You can't fake quality any more than you can fake a good meal. William S. Burroughs
_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost