<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
	<channel>
		<title>Benchmark on blog.asleson.org</title>
		<link>http://blog.asleson.org/tags/benchmark/</link>
		<description>Recent content in Benchmark on blog.asleson.org</description>
		<generator>Hugo</generator>
		<language>en-us</language>
		
			<managingEditor>tony dot asleson@gmail.com (Tony Asleson)</managingEditor>
		
		
			<webMaster>tony dot asleson@gmail.com (Tony Asleson)</webMaster>
		
		
			<copyright>&amp;copy; Copyright 1999-2026 Tony Asleson</copyright>
		
		
			<lastBuildDate>Mon, 13 Apr 2026 20:38:18 -0500</lastBuildDate>
		
			<atom:link href="http://blog.asleson.org/tags/benchmark/index.xml" rel="self" type="application/rss+xml" />
			<item>
				<title>Rustbucket</title>
				<link>http://blog.asleson.org/2026/04/13/rustbucket/</link>
				<pubDate>Mon, 13 Apr 2026 20:38:18 -0500</pubDate><author>tony dot asleson@gmail.com (Tony Asleson)</author>
				<guid>http://blog.asleson.org/2026/04/13/rustbucket/</guid>
				<description>&lt;p&gt;Sorting a terabyte of data in the late 1990s meant serious hardware, serious&#xA;planning, and probably a serious budget approval process. Today you can do it&#xA;on a workstation before lunch. I wanted to know how fast, so I wrote&#xA;&lt;a href=&#34;https://github.com/tasleson/rustbucket&#34;&gt;rustbucket&lt;/a&gt; to find out.&lt;/p&gt;&#xA;&lt;p&gt;It&amp;rsquo;s a two-phase external sort implemented in Rust, built around &lt;code&gt;io_uring&lt;/code&gt;,&#xA;and named for reasons that should be obvious to anyone who has spent time&#xA;with either Rust or storage systems.&lt;/p&gt;</description>
			</item>
	</channel>
</rss>
