REVIEW 1 cited by
Breaking the HBM Bit Cost Barrier: Domain-Specific ECC for AI Inference Infrastructure
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Breaking the HBM Bit Cost Barrier: Domain-Specific ECC for AI Inference Infrastructure
read the original abstract
High-Bandwidth Memory (HBM) delivers exceptional bandwidth and energy efficiency for AI workloads, but its high cost per bit, driven in part by stringent on-die reliability requirements, poses a growing barrier to scalable deployment. This work explores a system-level approach to cost reduction by eliminating on-die ECC and shifting all fault management to the memory controller. We introduce a domain-specific ECC framework combining large-codeword Reed--Solomon~(RS) correction with lightweight fine-grained CRC detection, differential parity updates to mitigate write amplification, and tunable protection based on data importance. Our evaluation using LLM inference workloads shows that, even under raw HBM bit error rates up to $10^{-3}$, the system retains over 78\% of throughput and 97\% of model accuracy compared with systems equipped with ideal error-free HBM. By treating reliability as a tunable system parameter rather than a fixed hardware constraint, our design opens a new path toward low-cost, high-performance HBM deployment in AI infrastructure.
Forward citations
Cited by 1 Pith paper
-
From Bit-Position Sensitivity to Unequal Error Protection for DNN Inference Memory
Per-bit fault injection on 16 DNNs yields safe-unprotected-bit floors (FP16:6, BF16:4, FP32:15) that power a selective-ECC codec with ~27.8% less ECC area and ~17% lower BF16 read energy.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.