Metraipolis › archive › dc_86ec76b2cf63
SnakeCharmer: Orchestrating Utility, Timeliness, and Placement in GPU Prefetching — arXiv:2610.30990
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.30990
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-23T15:24:28.142Z
- SHA-256 of the archived text
dec79f061ec6c1a80c8ed3e5aeda186053aa9ff25cd2214d45606daa4fd3f1b6- Stable URL of this page
https://metraipolis.com/documento/dc_86ec76b2cf63
How to cite
SnakeCharmer: Orchestrating Utility, Timeliness, and Placement in GPU Prefetching — arXiv:2610.30990 — arXiv (en), https://arxiv.org/abs/2610.30990 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_86ec76b2cf63 (Metraipolis archive dc_86ec76b2cf63, sha256 dec79f061ec6c1a80c8ed3e5aeda186053aa9ff25cd2214d45606daa4fd3f1b6)
BibTeX
@misc{dc86ec76b2cf63,
title = {SnakeCharmer: Orchestrating Utility, Timeliness, and Placement in GPU Prefetching — arXiv:2610.30990},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.30990},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_86ec76b2cf63; sha256 dec79f061ec6c1a80c8ed3e5aeda186053aa9ff25cd2214d45606daa4fd3f1b6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.30990. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
GPUs rely on massive thread-level parallelism to tolerate long memory latency, yet they still suffer severe stalls when many warps simultaneously wait for data from the memory system. Address-prediction-based GPU prefetchers can mitigate such stalls, but accurate prediction alone does not guarantee performance improvement: a predicted prefetch becomes beneficial only if it is worth issuing, arrives at the right time, and is retained without harmful interference. Because these requirements interact, optimizing any single dimension in isolation can simply move the bottleneck to another. We capture these requirements with a predicted-prefetch-to-realized-benefit perspective and propose SnakeCharmer, a unified backend prefetch-control framework for address-prediction-based GPU prefetchers. SnakeCharmer separates address prediction from prefetch realization: the frontend predictor generates prefetch candidates, while the backend control path jointly controls utility, timeliness, and placement by determining whether each candidate should be issued, when it should be issued, and where the returned data should be retained. SnakeCharmer realizes this control path with zero-value-aware filtering for utility, hierarchical feedback-driven distance tuning for timeliness, and a register-assisted prefetch buffer for placement. We design and implement SnakeCharmer primarily on top of Snake, and adapt the same backend-control principles to APOGEE to demonstrate that SnakeCharmer's benefits are not limited to a single frontend predictor. On an A100 GPU model, SnakeCharmer improves performance/energy efficiency by 12.8%/20.8% over Snake and by 1.7%/3.2% over APOGEE, with modest hardware overhead. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.AR, nuovi lavori del giorno). Categorie arXiv: Hardware Architecture (cs.AR). Pagina del lavoro: https://arxiv.org/abs/2610.30990 — 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-23T15:10:23.349Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).