<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Placement on Momo Engineering Journal</title><link>/tags/placement/</link><description>Recent content in Placement on Momo Engineering Journal</description><image><title>Momo Engineering Journal</title><url>/images/og-image.png</url><link>/images/og-image.png</link></image><generator>Hugo</generator><language>en-us</language><lastBuildDate>Wed, 07 Oct 2026 01:35:45 -0600</lastBuildDate><atom:link href="/tags/placement/index.xml" rel="self" type="application/rss+xml"/><item><title>R1: Failure-Domain-Aware Placement</title><link>/posts/019-r1-failure-domain-placement/</link><pubDate>Wed, 26 Aug 2026 23:52:57 +0000</pubDate><guid>/posts/019-r1-failure-domain-placement/</guid><description>Replicas must not ride in the same rack: CRUSH weights become rack/zone/DC-aware so a single domain failure can&amp;rsquo;t lose the data.</description></item><item><title>CRUSH-lite: Deterministic Weighted Placement</title><link>/posts/005-crush-placement/</link><pubDate>Tue, 30 Jun 2026 13:09:01 +0000</pubDate><guid>/posts/005-crush-placement/</guid><description>Weighted rendezvous hashing picks replicas deterministically and peer-equally without a central allocator — later hardened for failure domains. Teaches: content-hash-based placement, weighted rendezvous hashing, deterministic stable sort, failure domain filtering.</description></item></channel></rss>