<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Lock-Free on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/lock-free/</link>
    <description>Recent content in Lock-Free on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 29 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/lock-free/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>C&#43;&#43; Ring Buffer and Circular Buffer Libraries: Boost.CircularBuffer vs rigtorp/SPSCQueue vs Folly ProducerConsumerQueue</title>
      <link>https://www.pistack.xyz/posts/2026-06-29-cpp-ring-circular-buffer-libraries-boost-circularbuffer-spscqueue-folly/</link>
      <pubDate>Mon, 29 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-29-cpp-ring-circular-buffer-libraries-boost-circularbuffer-spscqueue-folly/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Ring buffers (also known as circular buffers) are one of the most fundamental data structures in systems programming. They provide fixed-size, FIFO (first-in-first-out) queue semantics with O(1) insertion and removal — making them ideal for embedded systems, audio processing, network packet buffering, and inter-thread communication. Unlike dynamic containers like &lt;code&gt;std::vector&lt;/code&gt; or &lt;code&gt;std::deque&lt;/code&gt;, ring buffers never allocate memory after construction, ensuring predictable latency and avoiding heap fragmentation.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
