<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>RCU on Moe's VR blog</title><link>https://mohandacherir.github.io/Qdiv7/tags/rcu/</link><description>Recent content in RCU on Moe's VR blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 09 Mar 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://mohandacherir.github.io/Qdiv7/tags/rcu/index.xml" rel="self" type="application/rss+xml"/><item><title>Notes On RCU</title><link>https://mohandacherir.github.io/Qdiv7/posts/notes_on_rcu/</link><pubDate>Mon, 09 Mar 2026 00:00:00 +0000</pubDate><guid>https://mohandacherir.github.io/Qdiv7/posts/notes_on_rcu/</guid><description>&lt;p>RCU is a mechanism in the Linux kernel for concurrency that is lock-free, wait-free (for readers) and that allows concurrent readers and a single updater.
RCU is made up of three fundamental mechanisms, one for &lt;strong>insertion&lt;/strong>, the other for &lt;strong>deletion&lt;/strong>, and the third being used to allow readers to tolerate &lt;strong>concurrent insertions and deletions&lt;/strong>. These mechanisms are described in the following sections, which focus on applying RCU to linked lists.&lt;/p></description></item></channel></rss>