Metraipolis › archive › dc_51cee0124cd8

Exact Multistate Reliability and Upgrade Design for Heterogeneous HBM Systems via Threshold-Pruned BAT — arXiv:2608.19471

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.19471
License (as archived)
CC0-1.0
Archived
2026-10-18T11:44:00.205Z
SHA-256 of the archived text
08b426a767d71809640a1726b5d364bc45008a17366fafe460bfdd4329b31c37
Stable URL of this page
https://metraipolis.com/documento/dc_51cee0124cd8

How to cite

Exact Multistate Reliability and Upgrade Design for Heterogeneous HBM Systems via Threshold-Pruned BAT — arXiv:2608.19471 — arXiv (en), https://arxiv.org/abs/2608.19471 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_51cee0124cd8 (Metraipolis archive dc_51cee0124cd8, sha256 08b426a767d71809640a1726b5d364bc45008a17366fafe460bfdd4329b31c37)
BibTeX
@misc{dc51cee0124cd8,
  title = {Exact Multistate Reliability and Upgrade Design for Heterogeneous HBM Systems via Threshold-Pruned BAT — arXiv:2608.19471},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.19471},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_51cee0124cd8; sha256 08b426a767d71809640a1726b5d364bc45008a17366fafe460bfdd4329b31c37},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19471. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

High Bandwidth Memory (HBM) systems can exhibit partial service rather than only full service or complete isolation: a controller-visible service unit may deliver full, reduced, or zero bandwidth because of sub-channel isolation, lane remapping, or protection overhead. This paper develops an exact multistate reliability framework in which each service unit carries an arbitrary finite set of bandwidth states and reliability is the probability that aggregate delivered bandwidth meets a demand. The binary k-out-of-n model is recovered as a special case, while closed-form binary-mapping error relations quantify mean-bandwidth distortion and provide a screening test for the simpler abstraction. For exact single-threshold evaluation a threshold-pruned multistate Binary-Addition-Tree (TP-mBAT) algorithm is proposed. It is deliberately regime-specific: fixed-grid dynamic programming is preferable on a compact common grid, where a 16-unit commensurate control required 273 pruned-DP updates versus 362,506 TP-mBAT node visits. On a reproducible 14-unit incommensurate benchmark, TP-mBAT is compared against a dynamic program carrying the same threshold rules, so that no baseline is weakened. Both expand the same state space, 6,862 nodes against 6,861 updates, and the separation lies entirely in retained state: 17 traversal entries against 412,121 probability states at central demand, reducing measured peak storage from 25.02 MB to 1,152 B. An exact probability-transfer sensitivity identifies when moving mass from a degraded state to a higher-bandwidth state changes system success, and a reserved-unit floor model admits a third exact pruning rule that is vacuous without such floors. A latent package-state mixture captures shared stress, where ignoring dependence overstates reliability by 8.73 percentage points.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-21 in cs.AR).
Categorie arXiv: Hardware Architecture (cs.AR) ; Performance (cs.PF); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.19471 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T11:39:29.373Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-08-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).