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☆192Updated 2 weeks ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 6 years ago
- QSBR and EBR library☆121Updated 5 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆83Updated 9 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆60Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- The world's first Web-scale memory allocator☆108Updated 7 years ago
- C++ interface to CPU affinity management☆30Updated 7 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated last year
- ☆17Updated 11 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆41Updated last year
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- An intrusive lock-free multiple-producer, single-consumer queue in C++☆52Updated 8 years ago
- C++ Library of Atomic and Lockless Data Structures☆38Updated 5 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆75Updated 10 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 years ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 14 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.☆33Updated 9 years ago
- Quick and dirty TSC access for benchmarking☆31Updated 8 years ago
- Implementaions of concurrent lock-free SPSC queue in c++.☆17Updated 7 years ago
- Effective Memory Reclamation☆58Updated 5 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago