urrency data structure implementation
is based on Intel implementation in its Threading Building Blocks ("Intel Material").
也就是微软的concurrent_vector是在Intel 的Threading Building Blocks基础上实现的。
方案3 Intel TBB(Threading Building Blocks)
Intel TBB 提供的功能
1 直接使用的线程安全容器，比如 concurrent_vector 和 concurrent_queue。
2 通用的并行算法，如 parallel_for 和 parallel_reduce。
3 模板类 atomic 中提供了无锁（Lock-free或者mutex-free）并发编程支持。
方案4 无锁数据结构支持库Concurrent Data Structures (libcds).
地址 http://sourceforge.net/projects/libcds/
下载以后里面直接有从VC2008到VC2013的编译环境，依赖于boost库
方案5 Boost 使用boost.lockfree
boost.lockfree实现了三种无锁数据结构：
1 boost::lockfree::queue
2 boost::lockfree::stack
3 boost::lockfree::spsc_queue
生产者-消费者
下面的代码实现的是
实现了一个多写生成，多消费 队列。
产生整数，并被4个线程消费
#include
#include
#include
#include
boost::atomic_int producer_count(0); boost::atomic_int consumer_count(0); boost::lockfree::queue
queue(128); const int iterations = 10000000; const int producer_thread_count = 4; const int consumer_thread_count = 4; void producer(void) { for (int i = 0; i != iterations; ++i) { int value = ++producer_count; while (!queue.push(value)) ; } } boost::atomic
done (false); void consumer(void) { int value; while (!done) { while (queue.pop(value)) ++consumer_count; } while (queue.pop(value)) ++consumer_count; } int main(int argc, char* argv[]) { using namespace std; cout << "boost::lockfree::queue is "; if (!queue.is_lock_free()) cout << "not "; cout << "lockfree" << endl; boost::thread_group producer_threads, consumer_threads; for (int i = 0; i != producer_thread_count; ++i) producer_threads.create_thread(producer); for (int i = 0; i != consumer_thread_count; ++i) consumer_threads.create_thread(consumer); producer_threads.join_all(); done = true; consumer_threads.join_all(); cout << "produced " << producer_count << " objects." << endl; cout << "consumed " << consumer_count << " objects." << endl; }