scotts / michaelLinks
Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
☆16Updated 10 years ago
Alternatives and similar repositories for michael
Users that are interested in michael are comparing it to the libraries listed below
Sorting:
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆45Updated 11 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆57Updated last year
- RLU resizable hash-table☆17Updated 9 years ago
- A more Pragmatic Implementation of the Lock-free, Ordered, Linked List☆17Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- Benchmarks for our memory allocator☆64Updated last year
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- For details, see the blog post:☆32Updated last year
- benchmarking positional population count☆14Updated last year
- A lock-free malloc(3) implementation☆19Updated last year
- unrolled skip list library for C☆21Updated 6 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- Cross-platform benchmarking for memory allocators, aiming to be as close to real world as it is practical