<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Storage on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/storage/</link><description>Recent content in Storage on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 07 Dec 2021 09:00:00 -0800</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/storage/feed.xml" rel="self" type="application/rss+xml"/><item><title>Checkpointing at Scale</title><link>https://www.rik-kisnah.ai/teach/gpu-ai/checkpointing-at-scale/</link><pubDate>Tue, 07 Dec 2021 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/gpu-ai/checkpointing-at-scale/</guid><description>A thousand-GPU job will be interrupted. The only question is how much work you lose when it is. Save often enough that a failure costs minutes, cheaply enough that saving does not cost more than the failures.</description></item><item><title>Design an Object Store</title><link>https://www.rik-kisnah.ai/teach/systems/design-an-object-store/</link><pubDate>Tue, 09 Nov 2021 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/systems/design-an-object-store/</guid><description>Put a file in, get the same bytes back ten years later, from any of a hundred million files, after a hundred disks have died. Separate the names from the bytes, cut every file into pieces with spares, and check the pieces forever.</description></item><item><title>Design a Log Search System</title><link>https://www.rik-kisnah.ai/teach/systems/design-a-log-search-system/</link><pubDate>Tue, 17 Nov 2020 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/systems/design-a-log-search-system/</guid><description>Every server writes thousands of lines a second. An engineer at 3am wants every line containing one request id from the last hour, in under two seconds. Ship, index, tier, and throw away. The hard part is the volume, not the search.</description></item><item><title>Design a Key-Value Store</title><link>https://www.rik-kisnah.ai/teach/systems/design-a-key-value-store/</link><pubDate>Tue, 07 Feb 2017 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/systems/design-a-key-value-store/</guid><description>A giant dictionary spread across many machines. Put a value under a key, get it back later, even when machines die. Partition, replicate, and decide what &amp;rsquo;later&amp;rsquo; means when two copies disagree.</description></item><item><title>Design a URL Shortener</title><link>https://www.rik-kisnah.ai/teach/systems/design-a-url-shortener/</link><pubDate>Tue, 17 May 2016 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/systems/design-a-url-shortener/</guid><description>Turn a long web address into a short one and back again. One table, one counter, one cache, one redirect. The whole design is deciding how to make the short code so two people never get the same one, then making the read path fast because reads outnumber writes a thousand to one.</description></item></channel></rss>