dashmap
sharded
| dashmap | sharded | |
|---|---|---|
| 12 | 1 | |
| 2,731 | 30 | |
| - | - | |
| 5.1 | 0.0 | |
| 18 days ago | over 1 year ago | |
| Rust | Rust | |
| MIT License | Apache License 2.0 |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
dashmap
- StupidAlloc: what if memory allocation was bad actually
-
dashmap VS scalable-concurrent-containers - a user suggested alternative
2 projects | 13 Apr 2023
-
Samsara, a safe Rust concurrent cycle collector
The problem is, every single one of these half-dozen crates has at least one known major issue (including UAF), exactly like C++ implementations (which isn't surprising since it's the kind of things where the ownership isn't clear and then the borrow checker can't help us).
-
Rust vs Go
Deadlocks and leaks are easy as other languages.
-
Shared mutable state is bad... so how do I create a global cache in a multi-threaded app?
Have you considered https://github.com/xacrimon/dashmap ?
-
Announcing Leapfrog, a faster concurrent HashMap
Dashmap made some api changes compared to the stdlibs hashmap, which leads to some oddities, as highlighted here: https://github.com/xacrimon/dashmap/issues/175
-
Writing a concurrent LRU cache
Some additional notes are in this slide deck and the implementation javadoc. You'd probably want to use something like DashMap for the hash table.
-
HashMap-based cache for async programs
You can look at existing concurrent maps like Dashmap https://github.com/xacrimon/dashmap or Cashmap https://gitlab.redox-os.org/redox-os/chashmap
-
How does one avoid lock of locks? or use the technique of latch crabbing of databases
Also dashmap
-
Noteworthy concurrent data structures?
The only one I've used is Dashmap, it's a concurrent interior-mutability hashmap. Very convenient crate in the case you need that.
sharded
-
Memory efficient hashmap?
https://github.com/greg7mdp/parallel-hashmap has a full write up on memory improvements over the equivalent C++. There’s a reference implementation I did in Rust here https://github.com/nkconnor/sharded focused on the concurrency side.
What are some alternatives?
hashbrown - Rust port of Google's SwissTable hash map
rust-phf - Compile time static maps for Rust
moka - A high performance concurrent caching library for Rust
hypergraph - Hypergraph is data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices.
HashMap - An open addressing linear probing hash table, tuned for delete heavy workloads
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
crossbeam - Tools for concurrent programming in Rust
staticvec - Implements a fixed-capacity stack-allocated Vec alternative backed by an array, using const generics.
leapfrog - Lock-free concurrent and single-threaded hash map implementations using Leapfrog probing. Currently the highest performance concurrent HashMap in Rust for certain use cases.
Coerce-rs - Actor runtime and distributed systems framework for Rust
megahash - A super-fast C++ hash table with Node.js wrapper, tested up to 1 billion keys.
scherben-map.rs - Concurrent Sharded HashMap for Rust