<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Performance on Javad Rajabzadeh | Senior Software Engineer</title><link>http://javad.dev/tags/performance/</link><description>Recent content in Performance on Javad Rajabzadeh | Senior Software Engineer</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 19 Sep 2026 15:30:00 +0330</lastBuildDate><atom:link href="http://javad.dev/tags/performance/index.xml" rel="self" type="application/rss+xml"/><item><title>HYDRA: When a Byte Range Stops Being a Promise</title><link>http://javad.dev/posts/hydra-range-preemption-engine/</link><pubDate>Sat, 19 Sep 2026 15:30:00 +0330</pubDate><guid>http://javad.dev/posts/hydra-range-preemption-engine/</guid><description>&lt;p&gt;Every download manager ever shipped asks its user two questions before a single byte has moved: how many connections should I open, and how finely should I slice the file? Both are scheduling decisions made with zero observations in hand, and both have unbounded worst-case error. Split an object evenly across $N$ connections and the makespan ratio against the achievable optimum is $\overline{\gamma}/\gamma_{\min}$ — unbounded in how heterogeneous the connections turn out to be. Split it in proportion to measured rates instead, which is the obvious repair, and it is &lt;em&gt;also&lt;/em&gt; unbounded, because any division fixed at $t=0$ is wrong the moment one rate moves.&lt;/p&gt;</description></item></channel></rss>