Concurrency Kit provides a plethora of concurrency primitives, safe memory reclamation mechanisms and non-blocking data structures designed to aid in the design and implementation of high performance concurrent systems.
Flexible
Concurrency Kit is specifically designed to allow you to choose the best synchronization mechanisms for your workloads. Features range from lock-free data structures to scalable synchronization mechanisms to atomic operations.
Portable
Concurrency Kit is designed to minimize dependencies on operating system-specific interfaces and relies only on a strict subset of the standard library and more popular compiler extensions.
Free
Concurrency Kit is released under the permissive Simplified BSD License for free of charge.
| Concurrency Primitives |
| atomic operations, memory barriers |
| Data Structures |
| bag, bitmap, fifo, hash set, hash table, list, ring, stack |
| Safe Memory Reclamation |
| epoch reclamation, hazard pointers |
| Synchronization |
| barrier, brlock, bytelock, cohort, pflock, rwlock, seqlock, spinlock |
| Supported Architectures |
| Power, SPARCv9, x86, x86-64 |
| Supported Compilers |
| gcc, clang, icc, mingw32, mingw64, suncc |
This license allows for unlimited distribution for any purpose as long as you agree to the disclaimers of warranty, keep them and keep the Copyright notices. This software is provided "as-is". Please read the license for more details.
User Spotlight
