Metraipolis › archive › dc_df92d15f3a32
Helix: A Unified Programmable Accelerator for Diverse Krylov Subspace Solvers — arXiv:2610.21096
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.21096
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:04:42.386Z
- SHA-256 of the archived text
35a6da91bb7d572ecff86f7b8f41f67526a121d49d10f938dff66cb5702bfb7b- Stable URL of this page
https://metraipolis.com/documento/dc_df92d15f3a32
How to cite
Helix: A Unified Programmable Accelerator for Diverse Krylov Subspace Solvers — arXiv:2610.21096 — arXiv (en), https://arxiv.org/abs/2610.21096 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df92d15f3a32 (Metraipolis archive dc_df92d15f3a32, sha256 35a6da91bb7d572ecff86f7b8f41f67526a121d49d10f938dff66cb5702bfb7b)
BibTeX
@misc{dcdf92d15f3a32,
title = {Helix: A Unified Programmable Accelerator for Diverse Krylov Subspace Solvers — arXiv:2610.21096},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.21096},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df92d15f3a32; sha256 35a6da91bb7d572ecff86f7b8f41f67526a121d49d10f938dff66cb5702bfb7b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21096. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Domain-specific accelerators deliver high performance and energy efficiency through specialization but often lack support for extensible algorithm families. Existing FPGA accelerators for Krylov subspace methods, which iteratively solve sparse linear systems, typically support a single solver or require separate hardware configurations. Helix follows a systematic algorithm-family design methodology that first abstracts common computational primitives from diverse Krylov solvers and builds the architecture around efficient, programmable primitive kernels. Helix then introduces programmable datapaths to coordinate these primitives. Its architecture decouples hardware implementation from solver-specific execution, enabling HBM reuse and zero solver-switching latency. Finally, Helix provides a DSL compiler that efficiently maps different solvers onto the architecture while optimizing vector-operation performance for each solver. We prototype Helix on a Xilinx Alveo U55C FPGA and evaluate Helix's practicality and performance by using it to compile and execute eight solvers. Helix achieves up to 7.91x and 1.16x speedups over Xilinx XcgSolver and the state-of-the-art FPGA accelerator Callipepla, respectively, both of which support only JPCG. Across the eight solvers, Helix sustains 47.5% - 96.9% of the throughput of an NVIDIA RTX PRO 6000 GPU while delivering 2.29x - 4.66x higher energy efficiency and 1.89x - 3.85x higher throughput per unit peak memory bandwidth. The programmable components incur 0.25% - 0.57% execution-time overhead and 4.7% LUT and 4.0% FF overhead, demonstrating negligible overhead for programmability. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Hardware Architecture (cs.AR) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2610.21096 — 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-16T08:45:02.690Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).