LPD-EPFL / ssmem
ssmem is a simple object-based memory allocator with epoch-based garbage collection
☆34Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for ssmem
- RLU resizable hash-table☆16Updated 9 years ago
- Transactional Data Structure Libraries☆12Updated 6 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
- Key-Value Store for Non-Volatile Memories uDepot☆44Updated 2 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 11 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆47Updated 9 years ago
- ☆20Updated last year
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A fast in-memory key-value store☆49Updated 7 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆33Updated 5 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 11 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆15Updated 10 years ago
- ☆51Updated 5 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆19Updated 3 years ago
- ☆10Updated 3 years ago
- Artifact for PPoPP'18☆17Updated 2 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- A tool for measuring the cache-coherence latencies of a processor (i.e., the latencies of loads, stores, CAS, FAI, TAS, and SWAP).☆75Updated 2 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 6 years ago
- NVM Evaluation Testbed☆28Updated 6 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆19Updated 3 years ago
- ☆26Updated 3 years ago
- A benchmark for cache efficient data structures.☆29Updated 5 years ago