Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"
☆17Sep 22, 2014Updated 11 years ago
Alternatives and similar repositories for michael
Users that are interested in michael are comparing it to the libraries listed below
Sorting:
- Lock-free multithreaded memory allocation☆111Dec 14, 2016Updated 9 years ago
- A lock-free malloc(3) implementation☆20Jun 15, 2025Updated 9 months ago
- ☆26Mar 12, 2017Updated 9 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Jun 26, 2019Updated 6 years ago
- Disk backed concurrent ART implementation, with optional generations.☆14Nov 8, 2023Updated 2 years ago
- A blend of the compact and sparse hash table implementations.☆15Aug 20, 2021Updated 4 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Jun 8, 2016Updated 9 years ago
- Lock-free allocator as described by Maged M. Michael, 2004☆48Sep 13, 2013Updated 12 years ago
- A collection of software bug types and articles showcasing the hunt for and exploitation of them.☆20Mar 2, 2021Updated 5 years ago
- Invoke SMT solvers from Coq to check obligations☆10Jun 16, 2020Updated 5 years ago
- The MemCAD static analyzer☆27Oct 15, 2021Updated 4 years ago
- Repository for ASE 2017 paper, "Modular Verification of Interrupt-driven Software".☆11May 20, 2019Updated 6 years ago
- perfgrind - tools for collecting samples from Linux performance events subsystem and converting profiling data to callgrind format, allow…☆15Dec 9, 2023Updated 2 years ago
- Collection of C++ Coroutine sample code☆12Feb 14, 2024Updated 2 years ago
- Hard Real-Time world-wide clock synchronization utilizing new better algorithms than PTP and NTP uses.☆15Jan 4, 2016Updated 10 years ago
- Shared memory allocator☆21Jun 27, 2016Updated 9 years ago
- Non-Blocking Buddy System☆18May 19, 2023Updated 2 years ago
- HAMT implementation whose sub-trees can be shared over threads☆10Feb 9, 2026Updated last month
- Fast comparison-based sort algorithm☆58Dec 21, 2022Updated 3 years ago
- hmemory is a lightweight memory error detector for c/c++ programs, specifically designed for embedded systems.☆17Oct 8, 2022Updated 3 years ago
- This project scrapes your own Optum HSA Save-It account using Selenium automation for Edge, outputting a csv file with all details☆10Apr 16, 2023Updated 2 years ago
- Compressed Bloom Filters (Golomb-compressed sequences, with indices)☆17May 19, 2013Updated 12 years ago
- Collection of datastructures for rustlang☆11May 11, 2022Updated 3 years ago
- Phase Fair and Standard Reader Writer Locks☆17Sep 16, 2019Updated 6 years ago
- Super Fast, Lock-Free, Wait-Free, CAS-free, thread-safe, memory allocator.☆187May 7, 2013Updated 12 years ago
- Rendering library for 2D/3D graphics☆25Dec 26, 2025Updated 2 months ago
- std::istream and std::ostream with compression☆12Jun 17, 2022Updated 3 years ago
- [deprecated] Tokio Linux zero-copy IO☆13Dec 9, 2023Updated 2 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆162Jun 23, 2025Updated 8 months ago
- Automatically exported from code.google.com/p/libhhash☆32Dec 6, 2015Updated 10 years ago
- Implementation of Adaptive Radix Tree in Rust☆44Feb 26, 2020Updated 6 years ago
- An implementation of various in-memory concurrency control protocols☆27Mar 30, 2024Updated last year
- ☆21Feb 26, 2019Updated 7 years ago
- ☆19Mar 12, 2026Updated last week
- unrolled skip list library for C☆22May 25, 2019Updated 6 years ago
- Library containing safer alternatives/wrappers for insecure C APIs.☆24Apr 2, 2025Updated 11 months ago
- a crate for small packed strings☆18Oct 31, 2022Updated 3 years ago
- DPDK based GTPv1 gateway☆24Aug 27, 2020Updated 5 years ago
- Implementation of hash_append proposal☆67Dec 14, 2016Updated 9 years ago