ChrisDodd / shm_malloc
Malloc replacement with support for shared and persistent memory allocation
☆33Updated 10 years ago
Alternatives and similar repositories for shm_malloc:
Users that are interested in shm_malloc are comparing it to the libraries listed below
- A lock-free hash table that eanble multiple threads can concurrently read/write/delete up to 10M ops/s in mordern computer platform☆52Updated last year
- W-TinyLFU cache C++11 header only implementation☆57Updated 6 years ago
- QSBR and EBR library☆118Updated 5 years ago
- Concurrent trie-hash map library☆91Updated last year
- Slab Memory Allocator in Application Layer☆27Updated 7 years ago
- lock free modified prefix B+tree append-only database☆116Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆140Updated 5 years ago
- A carefully optimised, POSIX-compatible slab allocator for userspace.☆76Updated 9 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆74Updated 3 years ago
- Lock-free work stealing deque written in C. This is implemented after Chapter 16 of "The Art of Multiprocessor Programming."☆19Updated 13 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆44Updated 11 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- A CPP wrapper for asynchronous socket server using linux's latest IO_URING API☆25Updated 2 years ago
- Different implementations of spinlock.☆104Updated 10 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Shared memory allocator☆19Updated 8 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆138Updated last year
- A simple, intrusive, zero-allocation red-black tree implementation☆44Updated 3 years ago
- LMAX's disruptor pattern implemented in C☆96Updated 6 years ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 10 years ago
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆87Updated 3 years ago
- ssmp is a highly optimized message-passing library built on top of the cache-coherence protocols of shared memory processors.☆22Updated 9 years ago
- A benchmark of some prominent C/C++ hash table implementations☆37Updated 4 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- Raft Consensus Algorithm Implementation in C++ (11)☆25Updated 10 years ago
- A simple header-only Multiversion Concurrency Control (MVCC) implementation in C++11.☆26Updated 9 years ago
- Buffer based LRU cache☆38Updated last year