parking_lot

A high-performance Rust library: it delivers synchronization primitives (Mutex, RwLock) that are significantly faster and more compact than the standard library's defaults.

This is the go-to crate for superior concurrency control in Rust. The core technology, the 'parking lot' algorithm, offloads thread queuing to a central system, keeping primitives small: Mutex and Once only require 1 byte of storage. Performance benchmarks confirm its efficiency: a `parking_lot::Mutex` is up to 1.5x faster uncontended than `std::sync::Mutex` on x86_64 Linux. Crucially, it offers optional compile-time deadlock detection, turning a complex debugging issue into a fast, actionable panic.

https://docs.rs/parking_lot