LaurieWired/tailslayer
Library for reducing tail latency in RAM reads observed · 2026-08-28
Health v2 · maintenance only
48/100
- Activity 76
- Release rhythm 35
- Longevity 10
Flags: no_releases young
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-03. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 150
- days_rel: n/a
- days_push: 144
- n_releases_24m: 0
Adoption not part of the score
2817 stars · 162 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
Tailslayer is a C++ header-only library that reduces tail latency in RAM reads caused by DRAM refresh stalls. It replicates data across independent DRAM channels with uncorrelated refresh schedules and issues hedged reads, using whichever replica responds first.
Use cases
- reduce tail latency of memory reads
- hide DRAM refresh stalls in low-latency systems
- hedge reads across DRAM channels
- build low-latency trading or HPC hot paths
- replicate hot data across memory channels
When to choose
- you need to shave microseconds off p99 memory read latency
- you run on AMD, Intel, or Graviton hardware and can pin to cores
- your workload is dominated by DRAM refresh stalls on a small hot dataset
When to avoid
- your dataset is too large to replicate across channels
- you need portability across arbitrary memory configurations
- you want a mature, widely production-tested solution
Facets
library · maturity experimental
concurrency developer-tools performance hardware developer-tools cpp cross-platform tail-latency dram-refresh hedged-reads low-latency memory performance linux
1 source
- readme: https://github.com/LaurieWired/tailslayer · fetched 2026-08-28 · 1ca23cd4c018
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| LaurieWired/tailslayer | main | 48 |
For agents
markdown · JSON · MCP: product_card(name="LaurieWired/tailslayer")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem