<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Web Servers on The Coders Blog</title><link>https://thecodersblog.com/categories/web-servers/</link><description>Recent content in Web Servers on The Coders Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 09 May 2026 15:58:07 +0000</lastBuildDate><atom:link href="https://thecodersblog.com/categories/web-servers/index.xml" rel="self" type="application/rss+xml"/><item><title>Lwan Web Server: Enhanced Performance with New Hash Table</title><link>https://thecodersblog.com/new-hash-table-for-lwan-web-server-2026/</link><pubDate>Sat, 09 May 2026 15:58:07 +0000</pubDate><guid>https://thecodersblog.com/new-hash-table-for-lwan-web-server-2026/</guid><description>&lt;p&gt;Even seemingly small data structure improvements can yield significant gains in high-traffic systems. The recent announcement from the Lwan web server project on May 6, 2026, regarding a new hash table implementation is a prime example of this principle in action. For a server designed for raw speed and minimal footprint, a foundational component like its hash table is critical. Moving away from a previously &amp;ldquo;heavily modified and inefficient kmod-based implementation&amp;rdquo; to a design inspired by modern, high-performance libraries like Rust&amp;rsquo;s &lt;code&gt;hashbrown&lt;/code&gt; and Abseil&amp;rsquo;s &lt;code&gt;SwissTable&lt;/code&gt; signals a clear intent to push Lwan’s performance envelope further. This isn&amp;rsquo;t just a minor tweak; it&amp;rsquo;s a strategic architectural shift addressing a core bottleneck that could have been hindering its ability to scale under heavy loads.&lt;/p&gt;</description></item></channel></rss>