<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Optimization on System &amp; Software Engineering</title>
    <link>https://riyaneel.github.io/tags/optimization/</link>
    <description>Recent content in Optimization on System &amp; Software Engineering</description>
    <generator>Hugo -- 0.159.2</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 28 Feb 2026 16:48:00 +0100</lastBuildDate>
    <atom:link href="https://riyaneel.github.io/tags/optimization/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>The O(1) Illusion: Why Pointer Chasing is the Death of Throughput</title>
      <link>https://riyaneel.github.io/posts/pointer-chasing/</link>
      <pubDate>Sat, 28 Feb 2026 16:48:00 +0100</pubDate>
      <guid>https://riyaneel.github.io/posts/pointer-chasing/</guid>
      <description>Algorithmic complexity assumes memory is flat and fast. It isn&amp;rsquo;t. A deep dive into why contiguous arrays destroy linked lists on modern superscalar CPUs.</description>
    </item>
    <item>
      <title>The &#39;If&#39; is an admission of failure: When algebra replaces decision</title>
      <link>https://riyaneel.github.io/posts/if-admission-failure/</link>
      <pubDate>Tue, 17 Feb 2026 13:42:58 +0100</pubDate>
      <guid>https://riyaneel.github.io/posts/if-admission-failure/</guid>
      <description>Why your Clean Code is poison for the CPU pipeline. Analyzing branch misprediction costs.</description>
    </item>
  </channel>
</rss>
