There are not that many full-fledged lock-free queues for C++. Boost has one, but it's limited to objects with trivial assignment operators and trivial destructors, for example. Intel's TBB queue isn't lock-free, and requires trivial constructors too. There're many academic papers that implement lock-free queues in C++, but usable source code is hard to find, and tests even more so. This queue not
CDS (Concurrent Data Structures) C++ library CDS library is (mostly) header-only template library. The shared library contains only garbage collector's core implementation. CDS contains implementation of some well-known lock-free and fine-grained data structures: Stack: TreiberStack [1986] R. K. Treiber. Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research C
This is the home of the Streamflow project, a scalable memory allocator for multithreaded applications. Source Code The current version has been developed for and tested on Linux, on x86, x86-64, ppc64 and ia64 platforms. http://github.com/scotts/streamflow/ As a part of our evaluation of Streamflow, we implemented Maged Michael's lock-free allocator as described in Scalable Lock-Free Dynamic Memo
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く