I had the idea for a series about async Rust that starts from scratch and works up to a fully featured async runtime.
I started writing around two years ago but never had the motivation to finish. I finally did.. I'm not sure how @fasterthanlime does it.
Ibraheem Ahmed
367 posts
- As of Rust 1.72.0, which releases on August 24th, mpsc::Sender will implement Sync whereas it previously only implemented Send and Clone! This makes it usable within an outer Arc and also makes it a lot nicer to work with in thread::scope:
- Excited to release papaya, a concurrent hash-table optimized for read-heavy workloads!
- Excited to announce that I'll be interning at @astral_sh over the summer (starting tomorrow)! I've been watching from afar from a while and look forward to working with @charliermarsh and the team.
- I doubt this bug, albeit relatively harmless, would have been caught in any other language. Miri has become extremely useful for testing concurrent code over the past few years.
- Replying to @charliermarshYou can do this in Rust too! I'll spare you the benchmark numbers.
- I was recently made aware that every single additional *cycle* in the hash function used by rustc increases its runtime by a whopping 0.25%
- Replying to @pcwaltonNot necessarily agreeing with the article, but when the entire ecosystem is built around async this isn't really a fair argument.
- The next version of papaya reaches over 2x the read throughput of dashmap!
- Getting very close to an initial release!Finally got around to writing it, looks good in some early read-heavy benchmarks.
- Replying to @timClicksA zero-length String, str, OsString, OsStr, CString, CStr, Path, or PathBuf?
- Finally got around to writing it, looks good in some early read-heavy benchmarks.Is there room for one more blazingly fast concurrent hashmap
- I've started making a habit of writing personal blog posts about topics I've learnt. They might not be ready to publish, but writing in explanatory form can really help you notice and fill gaps in your own understanding.





