Tagged articles
RCU
10 articles · Page 1 of 1
Linus Torvalds, after calling AI 90% hype, used Claude Code to implement an RCU-based fix for Linux kernel page cache contention that tripled throughput and cut cache-line bouncing by 99.6%, but kernel reviewers discovered a subtle race condition causing silent data corruption, requiring a human rewrite.
Claude CodeConcurrencyLinus Torvalds
0 likes · 12 min read


21CTOOct 14, 2026 · Backend Development
Linus Torvalds employed Claude Code to create an 8-patch series that removes a page-cache contention bottleneck for tiny concurrent reads, boosting 8-thread throughput from ~10M to ~32M reads/sec on a laptop, but the patches delay memory reuse via RCU grace periods and still have regressions, leaving them unmerged as of October 2024.
AI-assisted codingClaude CodeConcurrency
0 likes · 9 min read

The article provides an in‑depth technical analysis of CVE‑2026‑43074, a use‑after‑free race condition in the Linux kernel’s eventpoll implementation, detailing how Anthropic’s Mythos AI discovered the flaw, the underlying RCU‑based fix, its impact, exploitation constraints, and recommended mitigation steps.
AI code auditCVE-2026-43074Linux kernel
0 likes · 10 min read

This article explains the Linux kernel's Read‑Copy‑Update (RCU) mechanism, detailing its lock‑free read path, update workflow, grace period handling, performance benefits, limitations, real‑world applications, and essential API functions with practical code examples.
ConcurrencyLinuxRCU
0 likes · 33 min read

The article compares spin_lock, rwlock, seqlock and RCU for protecting a shared kernel resource in a multi‑core embedded system, explains how RCU enables lock‑free reads, discusses the challenges of safe deletion, and outlines the RCU read‑copy‑update workflow.
ConcurrencyRCUSeqlock
0 likes · 10 min read

DGraph, a C++ recommendation engine launched in 2022 for 得物, combines an index layer with a service layer, uses lock‑free RCU structures, a custom mmap‑based D‑Allocator, RoaringBitmap invert indexes, and a multi‑operator fusion scheduler to achieve high‑performance, eventually consistent, scalable recommendations.
C++RCUdistributed systems
0 likes · 12 min read

Linux kernel synchronization requires protecting shared mutable state from concurrent access using primitives such as spinlocks, mutexes, read‑write locks, or lock‑less techniques like RCU, which copies data and waits for a grace period, each offering distinct performance, latency, and complexity trade‑offs.
ConcurrencyLinux kernelMutex
0 likes · 26 min read

The Linux kernel’s page‑cache indexing migrated from the classic radix‑tree structure—using shift‑based multi‑way nodes, RCU‑protected insert, lookup, and delete operations—to the newer XArray API introduced in 4.20, which retains the radix layout while offering automatic resizing, built‑in locking, richer marking, and a cleaner, safer interface.
Linux kernelPage CacheRCU
0 likes · 17 min read

The article introduces HotRing, a hotspot‑aware in‑memory key‑value store from Alibaba's Tair team, explains the extreme traffic challenges of Alibaba's Double‑11 peak, details the design of ordered‑ring hashing, dynamic hotspot detection, lock‑free concurrency and rehashing, and shows how these innovations achieve up to 2.58× higher throughput than existing KV systems.
Database PerformanceHotRingRCU
0 likes · 16 min read


ITPUBSep 22, 2016 · Fundamentals
This article explains the design principles of Linux kernel RCU, details the implementation of rcu_read_lock, describes how interrupt handlers update shared data safely, and clarifies when old pointers can be reclaimed using call_rcu or synchronize_rcu.
CallbackConcurrencyLinux kernel
0 likes · 9 min read
