Tim Blechman dared to post a proposal for a 'boost.lockfree' library.
It looks like it may be usable in real-time contexts, since it
provides a custom memory allocator with pre-allocated memory, but also
lets you override that. I'm guessing it will be at least another year
before this is accepted in the Boost mainline. It would be great if
this library catches momentum.
Peter
---------- Forwarded message ----------
From: Tim Blechmann <tim [..] ...>
Date: Mon, Aug 17, 2009 at 13:54
Subject: [boost] boost.lockfree review request
To: boost [..] ...
hi all,
i would like to submit a small library of lock-free data structures for
review.
boost.lockfree provides implementations of lock-free data structures.
lock-free data structures can be accessed by multiple threads without
the necessity of blocking synchronization primitives such as guards.
lock-free data structures can be used in real-time systems, where
blocking algorithms may lead to high worst-case execution times, to
avoid priority inversion, or to increase the scalability for
multi-processor machines.
boost.lockfree provides:
* boost::lockfree::fifo, a lock-free fifo queue
* boost::lockfree::stack, a lock-free stack
the code is available from the boost vault:
http://www.boostpro.com/vault/index.php?action=downloadfile&filename=boo...
and from my personal git repository:
git://tim.klingt.org/boost_lockfree.git
http://tim.klingt.org/git?p=boost_lockfree.git
the documentation is available at:
http://tim.klingt.org/boost_lockfree/
thanks in advance,
tim
--
tim [..] ...
http://tim.klingt.org
You don't have to call it music if the term shocks you.
John Cage
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Attachment | Size |
---|---|
signature.asc | 197 bytes |