ssmem is a simple object-based memory allocator with epoch-based garbage collection
☆34Jun 8, 2016Updated 9 years ago
Alternatives and similar repositories for ssmem
Users that are interested in ssmem are comparing it to the libraries listed below
Sorting:
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆182Jan 19, 2018Updated 8 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆168Oct 4, 2021Updated 4 years ago
- RLU resizable hash-table☆17Aug 24, 2015Updated 10 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆17Sep 22, 2014Updated 11 years ago
- Lock-free Transactions without Rollbacks for Linked Data Structures☆23Sep 1, 2022Updated 3 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆49Aug 31, 2015Updated 10 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆22Apr 16, 2025Updated 10 months ago
- The world's first wait-free KV store with generic durable linearizable transactions☆41Feb 26, 2022Updated 4 years ago
- Constant time hex and base64 encode and decode☆27Oct 8, 2014Updated 11 years ago
- A benchmark to compare synchronization techniques for multicore programming☆348Jul 3, 2025Updated 7 months ago
- Nonblocking data structures☆12Jan 25, 2015Updated 11 years ago
- ☆126Apr 8, 2022Updated 3 years ago
- A set of macros and functions to make defining a C module easier☆11Sep 9, 2019Updated 6 years ago
- a non blocking hash map implementation in c☆14Apr 27, 2010Updated 15 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Mar 28, 2017Updated 8 years ago
- SMR Benchmark: A Microbenchmark Suite for Concurrent Safe Memory Reclamation Schemes☆46Aug 12, 2025Updated 6 months ago
- Programatically obtain information about the pages backing a given memory region☆82Oct 22, 2021Updated 4 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆32Feb 27, 2013Updated 13 years ago
- Provides painless access to namespaced environment variables.☆13Apr 20, 2021Updated 4 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- Distributed transactions☆13Sep 19, 2019Updated 6 years ago
- Framework for creating simple, efficient, and composable lock-free data structures☆12May 7, 2016Updated 9 years ago
- A clone of Joe Marshall's Rebol 1.0 to Scheme compiler.☆17Sep 23, 2012Updated 13 years ago
- Timer facilities for Tokio based on OS-level primitives.☆14May 7, 2020Updated 5 years ago
- Fast wait-free algorithms designed for shared memory systems☆45May 4, 2018Updated 7 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆162Jun 23, 2025Updated 8 months ago
- Atomix Jepsen tests☆14Feb 7, 2017Updated 9 years ago
- A multicore microprocessor test harness for measuring interference☆14Apr 16, 2020Updated 5 years ago
- an adaptive radix tree implementation in go☆69Oct 11, 2021Updated 4 years ago
- Disk backed concurrent ART implementation, with optional generations.☆14Nov 8, 2023Updated 2 years ago
- A simple implementation of the packed memory array☆20Sep 1, 2013Updated 12 years ago
- ☆15Mar 31, 2022Updated 3 years ago
- Non-blocking hash map in Rust☆13Mar 28, 2024Updated last year
- A public domain constant-time implementation of ChaCha20 on 8-bit AVR microcontroller.☆34Jun 28, 2018Updated 7 years ago
- Asynchronous Rust bindings for SPDK.☆18Nov 1, 2022Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Nov 26, 2023Updated 2 years ago
- FLECC_IN_C is a FLexible Elliptic Curve Cryptography library written IN C☆18Nov 17, 2017Updated 8 years ago
- ☆24Oct 11, 2014Updated 11 years ago