LPD-EPFL / ssmem
ssmem is a simple object-based memory allocator with epoch-based garbage collection
☆34Updated 8 years ago
Alternatives and similar repositories for ssmem:
Users that are interested in ssmem are comparing it to the libraries listed below
- RLU resizable hash-table☆17Updated 9 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Transactional Data Structure Libraries☆12Updated 7 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
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 14 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- 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
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- ☆20Updated 2 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 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
- 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
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- ☆12Updated 3 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- A collection of eclectic tools for measuring performance using the cycle counter and pinning threads.☆39Updated 9 months ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆24Updated 10 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- Sheriff consists of two tools: Sheriff-Detect, a false-sharing detector, and Sheriff-Protect, a false-sharing eliminator that you can lin…☆32Updated 6 years ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- Dependably fast multi-core in-memory transactions☆19Updated 7 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago