What is a quiescent state and why does it matter in RCU?
A quiescent state is a point where a CPU is guaranteed not to be in a read-side critical section. Common quiescent states are context switches and RCU unlock calls. The grace period ends when every CPU has hit a quiescent state at least once, guaranteeing no reader still holds the old data.
Answered in
How Linux RCU Unlocks Read-Side ScalingRCU lets millions of readers run lock-free while a single writer updates state by copying, mutating off-to-the-side, and atomically flipping a pointer.
Read the full analysisOther questions this article answers
More system design questions
- Why doesn't Google just run Dijkstra faster?
- What is a shortcut edge and when is it precomputed?
- How much space do shortcut edges take compared to the original graph?
- Can Contraction Hierarchies handle dynamic graphs like traffic or road closure?
- Why contract low-degree nodes first instead of high-degree ones?
- What is a CRDT and why does it matter for real-time collaboration?
- How do CRDTs handle concurrent edits without a central server referee?
- Why did Figma move from operational transforms to CRDTs?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the System Design beat.