wvwwvwwv / scalable-delayed-deallocLinks
Scalable and lock-free memory reclamation system
☆37Updated last month
Alternatives and similar repositories for scalable-delayed-dealloc
Users that are interested in scalable-delayed-dealloc are comparing it to the libraries listed below
Sorting:
- Experimenting with Rust's fundamental data model☆58Updated 3 months ago
- Combinator methods for `std::AsyncIterator` using all the new `async` superpowers☆10Updated last year
- (lifetime) GATs on stable Rust☆59Updated 2 years ago
- Memory validation framework for Rust☆75Updated 3 months ago
- Human-friendly indexed collections☆56Updated 3 months ago
- A low-level MVCC file format for storing blobs.☆64Updated last year
- Fast byte array to hex string conversion☆62Updated 3 months ago
- Generate markdown comparison tables from `cargo-criterion` JSON output☆35Updated 3 years ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆88Updated last year
- Trying to create Sync bump allocator☆41Updated 6 months ago
- A fast and flexible LRU map.☆199Updated last year
- Finding ownership bugs at scale.☆30Updated this week
- Ergonomic and composable async stream generation without macros☆24Updated last month
- Library and proc macro to analyze memory usage of data structures in rust.☆193Updated last month
- Lending iterators on stable Rust☆83Updated 2 years ago
- Hardware-based tick counters for high-precision benchmarks in Rust☆29Updated last year
- Arbitrary, fixed size numeric types that extend the functionality of primitive numeric types in Rust.☆118Updated 3 weeks ago
- Serde Visitor for deserializing untagged enums☆69Updated last month
- Reports when tokio runtime threads are blocking☆66Updated last year
- Cross-platform implementation of cross-process named locks☆38Updated last year
- Better reference counted strings for Rust☆140Updated last year
- This is a project to learn how to implement instruction dispatch in Rust.☆25Updated last year
- Fast Function Dispatch: Improving the performance of Rust's dynamic function calls☆36Updated last year
- ☆34Updated last year
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆67Updated this week
- ☆64Updated 3 months ago
- Async, lock-free synchronization primitives for task wakeup☆51Updated last year
- SIMD-optimized B+ Tree implementation that uses integer keys☆93Updated 6 months ago
- Fast and correct async IO runtime in a small amount of readable code. Inspired by tokio☆72Updated last year
- Library facilitating safe pinned initialization☆75Updated this week