<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Load Balancing on Nalar</title>
    <link>https://nalar.dev/tags/load-balancing/</link>
    <description>Recent content in Load Balancing on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sun, 20 Sep 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/load-balancing/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Power of Two Choices Reduces Load Imbalance with Two Samples</title>
      <link>https://nalar.dev/power-of-two-choices-reduces-load-imbalance-with-two-samples/</link>
      <pubDate>Sun, 20 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://nalar.dev/power-of-two-choices-reduces-load-imbalance-with-two-samples/</guid>
      <description>&lt;h1 id=&#34;power-of-two-choices-reduces-load-imbalance-with-two-samples&#34;&gt;Power of Two Choices Reduces Load Imbalance with Two Samples&lt;/h1&gt;&#xA;&lt;p&gt;A load balancer that chooses one destination uniformly at random is cheap and decentralized, but random placement can produce uneven queues. At the other extreme, selecting the least loaded destination from the entire pool requires current load information for every candidate and can make the balancer itself expensive.&lt;/p&gt;&#xA;&lt;p&gt;The power-of-two-choices strategy sits between those designs. For each request, sample two eligible destinations, compare a load signal, and send the request to the better candidate. Two observations are enough to avoid many unlucky placements without requiring a global search.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
