Boost logo

Boost Announcement :

Subject: [Boost-announce] [Review] Lockfree review starts today, July 18th
From: Hartmut Kaiser (hartmut.kaiser_at_[hidden])
Date: 2011-07-18 09:32:30

Hi all,

The review of Tim Blechmann's Boost.Lockfree library starts today, July 18th
2011, and will end on July 28th.
I really hope to see your vote and your participation in the discussions on
the Boost mailing lists!


About the library:

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.

The following data structures are provided:

- boost::lockfree::fifo, a lock-free fifo queue
- boost::lockfree::stack, a lock-free stack
- boost::lockfree::atomic_int, an atomic integer class

The library is accessible from here:

Boost.Lockfree depends on C++0x atomics. They are not well supported with
current compilers yet. For this reason Boost.Lockfree depends on the
*unreviewed* Boost.Atomic library, that emulates C++0x atomics for C++98.
This review is about Boost.Lockfree and not about Boost.Atomic, although it
is included in the tarball and the git repository.

If Boost.Lockfree will be accepted, it won't be merged into trunk before
Boost.Atomic is accepted.


Please always state in your review, whether you think the library should be
accepted as a Boost library!

Additionally please consider giving feedback on the following general

- What is your evaluation of the design?
- What is your evaluation of the implementation?
- What is your evaluation of the documentation?
- What is your evaluation of the potential usefulness of the library?
- Did you try to use the library? With what compiler? Did you have any
- How much effort did you put into your evaluation? A glance? A quick
reading? In-depth study?
- Are you knowledgeable about the problem domain?

Regards Hartmut
Review Manager

Boost-announce list run by bdawes at, david.abrahams at, gregod at, cpdaniel at, john at