Metraipolis › archive › dc_acb002cc49c8
Memory Admission and Result-Retention Sizing in an RV32IMC FPGA Soft Processor — arXiv:2611.02974
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02974
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:13:29.940Z
- SHA-256 of the archived text
2c0d0d080ae3903ad88a069d156b2e69e9f77066ac189a52dfa97147e8de8071- Stable URL of this page
https://metraipolis.com/documento/dc_acb002cc49c8
How to cite
Memory Admission and Result-Retention Sizing in an RV32IMC FPGA Soft Processor — arXiv:2611.02974 — arXiv (en), https://arxiv.org/abs/2611.02974 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_acb002cc49c8 (Metraipolis archive dc_acb002cc49c8, sha256 2c0d0d080ae3903ad88a069d156b2e69e9f77066ac189a52dfa97147e8de8071)
BibTeX
@misc{dcacb002cc49c8,
title = {Memory Admission and Result-Retention Sizing in an RV32IMC FPGA Soft Processor — arXiv:2611.02974},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02974},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_acb002cc49c8; sha256 2c0d0d080ae3903ad88a069d156b2e69e9f77066ac189a52dfa97147e8de8071},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02974. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In FPGA soft processors with shared backing block RAM, memory admission can stall a multiplication after its product has been prepared. We study how admission timing changes result retention in PaceRV, our board-tested five-stage RV32IMC core, using fixed binaries and matched dynamic instructions. Offering data requests one edge earlier reduces geometric-mean Embench cycles by 18.2% and retention opportunities from 375,063 to 4,373. Admission and retention cycle gains are conditional and non-additive. Under slower reads, a 99% capture target selects an 18-edge validity window with registered requests and 28 edges with early requests, although no multiplication matched within both measurement intervals waits longer. A predeclared sizing rule predicts opportunity recovery exactly in all finite tests, including kernels excluded from model development. Independent timing analysis closely estimates execution-cycle savings. The results support choosing admission first, then deciding whether to extend validity and sizing it against an explicit capture or missed-opportunity objective. 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/2611.02974 — 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-11-03T11:00:22.173Z dalla pagina https://arxiv.org/list/cs.AR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).