stretto
Stretto is a Rust implementation for Dgraph's ristretto (https://github.com/dgraph-io/ristretto). A high performance memory-bound Rust cache. (by al8n)
dashmap
Blazing fast concurrent HashMap for Rust. (by xacrimon)
| stretto | dashmap | |
|---|---|---|
| 6 | 12 | |
| 397 | 2,726 | |
| - | - | |
| 5.7 | 5.5 | |
| 4 days ago | 7 days ago | |
| Rust | Rust | |
| Apache License 2.0 | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
stretto
Posts with mentions or reviews of stretto.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-07-07.
-
Stretto 0.5.0 release: Support runtime agnostic AsyncCache
Hi, I think this link is a good explanation https://github.com/al8n/stretto/pull/7
-
Writing a concurrent LRU cache
Ya, I saw concache but I looked into it and it doesn't implement what is needed. Each bucket has its own linked-list backing (hence "lock-free linked list buckets"). An LRU needs each value in each bucket to be part of one linked list I believe. After posting this I realized my line of research was failing because it was state of the art five years ago. Caffeine replaced `concurrentlinkedhashmap` in the java world (by the same author). A rust version of that is Moka. These are much more complicated than a concurrent LRU but faster (aka more state of the art). Another rust crate is Stretto which is a port of dgraph's Ristretto (in go). The question becomes is it worth it to essentially port `concurrentlinkedhashmap` to have a great concurrent LRU when there are more state of the art caches out there.
-
Stretto - a thread-safe, high-performance, high hit-ratio cache.
For the case in the benches folder(a very roughly bench case), stretto is around 20 - 30 ms(sync version is around 30 - 40 ms) faster than moka, for 120, 000+ operations. I set stretto to collect metrics when benching, collecting metrics will make around 10% overhead. Moka seems not to provide a configuration to collect the metrics, so the hit-ratio is not compared.
dashmap
Posts with mentions or reviews of dashmap.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-07-07.
- 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.
What are some alternatives?
When comparing stretto and dashmap you can also consider the following projects:
ristretto - A high performance memory-bound Go cache
hashbrown - Rust port of Google's SwissTable hash map
moka - A high performance concurrent caching library for Rust
rust-memcache - memcache client for rust
HashMap - An open addressing linear probing hash table, tuned for delete heavy workloads
bitsock - Safe Rust crate for creating socket servers and clients with ease.
crossbeam - Tools for concurrent programming in Rust
ttl_cache
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.
bmemcached-rs - Rust binary memcached implementation
megahash - A super-fast C++ hash table with Node.js wrapper, tested up to 1 billion keys.