Metraipolis › archive › dc_705baea8727b

ARMOR: Accelerating RTL Simulation by Mitigating the Front-End Bottleneck Using Node Compression — arXiv:2608.08462

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08462
License (as archived)
CC0-1.0
Archived
2026-10-19T08:53:20.458Z
SHA-256 of the archived text
7b83b197b29a3d421a92b201f44abbf6786d933db1c2d28a7314a53b4a9b2068
Stable URL of this page
https://metraipolis.com/documento/dc_705baea8727b

How to cite

ARMOR: Accelerating RTL Simulation by Mitigating the Front-End Bottleneck Using Node Compression — arXiv:2608.08462 — arXiv (en), https://arxiv.org/abs/2608.08462 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_705baea8727b (Metraipolis archive dc_705baea8727b, sha256 7b83b197b29a3d421a92b201f44abbf6786d933db1c2d28a7314a53b4a9b2068)
BibTeX
@misc{dc705baea8727b,
  title = {ARMOR: Accelerating RTL Simulation by Mitigating the Front-End Bottleneck Using Node Compression — arXiv:2608.08462},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08462},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_705baea8727b; sha256 7b83b197b29a3d421a92b201f44abbf6786d933db1c2d28a7314a53b4a9b2068},
  year = {2026}
}

Archived text

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

RTL simulation is indispensable in chip design. High-performance simulators typically lower each node in the RTL graph into an instruction sequence. Although this per-node lowering enables aggressive compiler optimizations, it dramatically increases the code footprint, severely exceeding instruction cache capacity and causing front-end bottlenecks. Our profiling reveals that over 50% of pipeline stalls are caused by the CPU front-end, becoming a key performance bottleneck in state-of-the-art RTL simulators. However, reaping the optimization benefits of fully unrolling the RTL graph while simultaneously reducing the code footprint to mitigate front-end bottlenecks remains highly challenging. In this paper, we propose ARMOR, an efficient RTL simulator designed to alleviate the front-end bottleneck through node compression. The key idea is to exploit the data parallelism exposed by the unrolling RTL graph and the insufficient bit-space utilization revealed by per-node lowering, leveraging bit-level data parallelism to compress multiple nodes simultaneously, so that a single instruction sequence can serve multiple nodes instead of one per node. To achieve profitable node compression, we first propose a module-aware isomorphic subgraph identification method that leverages structural isomorphism across module instances to systematically identify compression opportunities at the subgraph level. We then propose an alignment-aware dense packing strategy that groups nodes into packs according to dataflow dependencies while preserving data reuse, complemented by greedy merging strategies to enhance bit-space utilization. Finally, we implement a unified bit-level parallelism scheme to support bit-level parallel execution of compressed nodes. Experimental results show that ARMOR achieves 1.6x speedup on CPU designs and 2.7x speedup on AI accelerators compared to state-of-the-art simulators.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-11 in cs.AR).
Categorie arXiv: Hardware Architecture (cs.AR).
Pagina del lavoro: https://arxiv.org/abs/2608.08462 — 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-19T08:50:52.494Z dalla pagina https://arxiv.org/catchup/cs.AR/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).