<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Concurrency on Nalar</title>
    <link>https://nalar.dev/tags/concurrency/</link>
    <description>Recent content in Concurrency on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 01 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/concurrency/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Bounded Concurrency in Go with a Worker Pool</title>
      <link>https://nalar.dev/bounded-concurrency-worker-pool-go/</link>
      <pubDate>Tue, 01 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/bounded-concurrency-worker-pool-go/</guid>
      <description>&lt;p&gt;Goroutines are cheap, but the resources they call are often not. Starting one goroutine for every item in a large batch can overwhelm a database connection pool, trigger API rate limits, exhaust file descriptors, or create avoidable memory pressure.&lt;/p&gt;&#xA;&lt;p&gt;Bounded concurrency solves this by allowing only a fixed number of operations to run at the same time. A worker pool is one of the simplest standard-library patterns for implementing that limit in Go.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Request Coalescing in Go Without Extra Dependencies</title>
      <link>https://nalar.dev/request-coalescing-in-go/</link>
      <pubDate>Tue, 01 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/request-coalescing-in-go/</guid>
      <description>&lt;p&gt;When many requests ask for the same expensive resource at the same time, running identical work for every caller can overload a database, API, or filesystem. A cache can help after a result exists, but it does not necessarily prevent several concurrent cache misses from triggering the same backend operation.&lt;/p&gt;&#xA;&lt;p&gt;Request coalescing solves a different problem: while one operation for a key is already running, later callers wait for that operation and share its result. After the operation finishes, the result is forgotten. The next request starts fresh work.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
