How does each Monocle storage worker process data?
Each storage worker manages a shard and its own LSM-tree instance on a single-threaded Tokio scheduler. Datadog says the shard-per-thread design avoids cross-thread contention on a worker's private memtable.
Answered in
Inside Datadog’s Monocle: A Rust Engine for Real-Time MetricsDatadog's Monocle uses worker-per-shard LSM trees, private memtables, a unified series cache, and tiered compaction for recent metrics.
Read the full analysisOther questions this article answers
More systems architecture questions
- How did Linear choose to implement multi-region hosting?
- How does Linear route requests to a workspace’s region?
- Does hosting workspace data in Europe by itself guarantee GDPR compliance?
- How did Reddit compare a new Go read endpoint with its Python endpoint?
- Why did Reddit use sister datastores for comment writes?
- What performance result did Reddit report?
- What did Shopify test ahead of BFCM 2025?
- What is Genghis in Shopify’s readiness program?
Every answer on Crashtech is written by the editor of the article it comes from — never auto-summarised. Browse all answers or the Systems Architecture beat.