tabokie / coplus
Parallel programming library in C++11
☆12Updated 5 years ago
Alternatives and similar repositories for coplus:
Users that are interested in coplus are comparing it to the libraries listed below
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A nano concurrency library☆24Updated 4 years ago
- measure entropy of memory allocators☆12Updated 3 years ago
- ☆20Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- Package p384 is an AMD64-optimized P-384 implementation.☆9Updated 6 years ago
- ☆25Updated 7 years ago
- Infomation about C++ Coroutines TS v1 software and content☆9Updated 6 years ago
- ☆13Updated last year
- ☆12Updated last year
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆39Updated 8 months ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- ☆11Updated 8 years ago
- Toy prototype for a distributed computing system in C++☆18Updated 10 years ago
- String to Float Benchmark☆19Updated 6 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- NetBSD cdb (constant database) library☆14Updated 5 years ago
- LLVM-jitted bitmaps☆27Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- A lightweight concurrency library for C, featuring symmetric coroutines as the main control flow abstraction.☆11Updated 9 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- AVX-2 vectorised 8-bit positional popcount for Go☆23Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- A universal thread-safe memory pool.☆26Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated 3 months ago
- The k-LSM: A relaxed, lock-free, linearizable priority queue☆23Updated 7 years ago