Naruil / SSMallocLinks
A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability
☆68Updated 11 years ago
Alternatives and similar repositories for SSMalloc
Users that are interested in SSMalloc are comparing it to the libraries listed below
Sorting:
- Our open source benchmarks and code samples☆193Updated 2 weeks ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆84Updated 9 years ago
- Cross-platform atomic operations and lock algorithm library☆99Updated 7 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 10 years ago
- QSBR and EBR library☆133Updated 5 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆141Updated 2 years ago
- Lock-free multithreaded memory allocation☆110Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆47Updated 12 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- ☆17Updated 11 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 9 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆70Updated last year
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.☆33Updated 9 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆78Updated 11 years ago
- High-performance multicore-scalable data structures and benchmarks☆143Updated 6 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- C++ interface to CPU affinity management☆30Updated 7 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆181Updated 7 years ago
- The world's first Web-scale memory allocator☆109Updated 7 years ago
- Various small bits of code, generally testing small edge cases in the language☆42Updated 3 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- Quick and dirty TSC access for benchmarking☆32Updated 9 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- A benchmark of some prominent C/C++ hash table implementations☆105Updated 6 years ago
- Memory alignment wrappers, useful for avoiding false sharing☆41Updated 9 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆90Updated 3 years ago
- Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.☆181Updated 12 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago