ChrisDodd / shm_mallocLinks
Malloc replacement with support for shared and persistent memory allocation
☆32Updated 11 years ago
Alternatives and similar repositories for shm_malloc
Users that are interested in shm_malloc are comparing it to the libraries listed below
Sorting:
- A lock-free hash table that eanble multiple threads can concurrently read/write/delete up to 10M ops/s in mordern computer platform☆52Updated 2 years ago
- Small C fiber library that uses libev based event loop and libcoro based coroutine context switching.☆139Updated 5 years ago
- QSBR and EBR library☆123Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆98Updated 7 years ago
- Concurrent trie-hash map library☆92Updated last year
- This is the user space slab memory allocator, umem, first available in Solaris 9.☆88Updated 3 years ago
- Slab Memory Allocator in Application Layer☆28Updated 7 years ago
- Different implementations of spinlock.☆105Updated 10 years ago
- C11 Lock-free Stack☆183Updated last year
- Lock-free allocator as described by Maged M. Michael, 2004☆46Updated 11 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- lock free modified prefix B+tree append-only database☆117Updated 10 years ago
- A Low-latency, Locality-conscious Memory Allocator with Stable Performance Scalability☆68Updated 11 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 14 years ago
- A basic implementation of UDP-based Data Transfer protocol (UDT) in C☆91Updated 5 years ago
- High performance AVL tree container C implementation☆57Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 9 years ago
- Lightweight C coroutines (derived from http://software.schmorp.de/pkg/libcoro.html)☆124Updated last year
- Shared memory queue benchmarks and tracing for blog☆80Updated 9 years ago
- Our open source benchmarks and code samples☆192Updated last month
- A simple, intrusive, zero-allocation red-black tree implementation☆52Updated 3 years ago
- Fast wait-free algorithms designed for shared memory systems☆46Updated 7 years ago
- Key-Value/Document store database library with btree and ARTree indexing methods, SSN-MVCC concurrency☆75Updated 4 years ago
- Shared memory allocator☆21Updated 9 years ago
- A lightweight (3 file, single function) library for running micro-benchmarks on C++ code☆83Updated 9 years ago
- A User Space Threading Library Supporting Multi-Core Systems☆140Updated 2 years ago
- Git mirror of the official (mercurial) repository of cpp-btree☆75Updated 11 years ago
- A single producer single - single consumer queue implemented by a ring buffer with C11's 'stdatomic.h'☆37Updated last year
- Tick-based timer (hierarchical timing wheel algorithm)☆44Updated 5 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