Begun / lockfree-mallocLinks
The world's first Web-scale memory allocator
☆108Updated 6 years ago
Alternatives and similar repositories for lockfree-malloc
Users that are interested in lockfree-malloc are comparing it to the libraries listed below
Sorting:
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated last year
- A C++ pointer bump memory arena implementation☆93Updated 10 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- portability macros for compiler and hardware micro operations☆36Updated last year
- Our open source benchmarks and code samples☆192Updated 2 weeks ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated 3 weeks ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- An implementation of the Judy array, wrapped in a c++ template. Uses Karl Malbrain's implementation, http://code.google.com/p/judyarray/ …☆42Updated 10 years ago
- Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.☆178Updated 12 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆74Updated 10 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- Specialized memory allocators☆105Updated 2 months ago
- A portable in-place bitwise binary Fredkin trie algorithm which allows for near constant time insertions, deletions, finds, closest fit f…☆275Updated 3 years ago
- Implementing coroutines, channels, message passing, etc.☆133Updated 3 years ago
- Lightweight C coroutines (derived from http://software.schmorp.de/pkg/libcoro.html)☆123Updated last year
- C++ library for collecting user-defined in-process runtime statistics with low overhead☆98Updated 6 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- A simple, intrusive, zero-allocation red-black tree implementation☆51Updated 3 years ago
- Mordor is a high performance I/O library based on fibers.☆21Updated 7 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- http server with libev and coroutines☆45Updated 5 years ago
- Coroutines/Fibers implementation for x86☆65Updated 8 years ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 2 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 8 years ago
- Automatically exported from code.google.com/p/relacy☆223Updated 2 months ago
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆166Updated 4 months ago
- C11 Lock-free Stack☆184Updated last year
- The stack_unwinding is a small header only C++ library which supplies primitive(class unwinding_indicator) to determining when object des…☆84Updated 9 years ago