Lightning talk: ArcShift: Going faster than RwLock
summary
ArcShift is a lock-free replacement for ArcRwLock that adds next/prev/advance links so readers do a relaxed atomic read and follow a chain of immutable values instead of incrementing a reader counter. Benchmarks show about 10× faster read in microbenchmarks and up to 100× faster under contention while updates are ~5× slower. Memory reclamation uses an advance and GC protocol and the implementation is validated with loom, shuttle, MIRI, cargo‑mutants and published on crates.io as ArcShift.
AI-written summary · about
chapters (8)
- 0:00Introduction and motivation
- 1:04Performance challenges
- 1:52Data layout and design
- 3:29The ArcShift architecture
- 5:06Benchmarking results
- 6:38Lock-free theory
- 7:22Assuring correctness
- 10:05Conclusion
related talks
54mKEYNOTE: A journey through incremental computation
01h 06m“How to make your data structures wait-free for reads"
01h 00mLock-Free Programming (or, Juggling Razor Blades), Part I
19mProduction Unsafe Rust
09mLightning Talk: MORK (in Rust)
20mThe status of parallel rustc
56mReader-Writer Lock versus Mutex
01h 12mThe speed of concurrency (is lock-free faster?)
