Tag
The author reviews the free online textbook 'Is Parallel Programming Hard, And, If So, What Can You Do About It?' by Paul E. McKenney, discussing its focus on lock-free concurrency and CPU cache effects, and shares personal context about reading it during a vacation.
This article introduces iceoryx2's ByteAtomic, a byte-wise atomic wrapper that prevents undefined behavior when implementing lock-free primitives like sequence locks in Rust and C++.
A guide to implementing a fast lock-free queue in modern C++, covering techniques for concurrent data structures without locks.
A 2019 blog post argues that preemption (interrupts) can be used as a pre-paid barrier for memory ordering in lock-free programming, similar to how garbage collection is a sunk cost, and demonstrates implementations for event counts and asymmetric flag flips on Linux/x86.
A technical blog post detailing the design and implementation of a lock-free MPMC queue with bounded waiting, including theory, advantages, limitations, and benchmark comparisons.
Venkat explains that unoptimized CPU work in the hot path can severely impact inference performance, and introduces his PR to mooncake that adds a memory arena for lock-free, allocation-free operations, benefiting vLLM and SGL projects.