Metraipolis › archive › dc_99da3aa097c3

Benchmarking CPU, GPU, and ML Power-Flow Solvers from 14 to 70,000 Buses — arXiv:2610.27930

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.27930
License (as archived)
CC0-1.0
Archived
2026-10-21T07:11:23.931Z
SHA-256 of the archived text
9e8d67c8eb8a0482b92855a8074956cefd745b57374078a196e352321f40f53c
Stable URL of this page
https://metraipolis.com/documento/dc_99da3aa097c3

How to cite

Benchmarking CPU, GPU, and ML Power-Flow Solvers from 14 to 70,000 Buses — arXiv:2610.27930 — arXiv (en), https://arxiv.org/abs/2610.27930 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99da3aa097c3 (Metraipolis archive dc_99da3aa097c3, sha256 9e8d67c8eb8a0482b92855a8074956cefd745b57374078a196e352321f40f53c)
BibTeX
@misc{dc99da3aa097c3,
  title = {Benchmarking CPU, GPU, and ML Power-Flow Solvers from 14 to 70,000 Buses — arXiv:2610.27930},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.27930},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99da3aa097c3; sha256 9e8d67c8eb8a0482b92855a8074956cefd745b57374078a196e352321f40f53c},
  year = {2026}
}

Archived text

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

Learned surrogates for power-flow (PF) computation are usually motivated by speed, compared against a single CPU-based baseline. We show this comparison is fragile: across 7 open-source CPU-based solvers evaluated on identical inputs, throughput varies by roughly 2.5-3 orders of magnitude, so the choice of baseline alone can flip the conclusion. We build a benchmark spanning 9 physics-based solvers: 7 CPU-based and 2 GPU-based, including a new batched GPU solver, gumsim2grid - and 3 published ML surrogates, evaluated under a shared, independently implemented KCL-mismatch check across 15 grids from 14 to 70,000 buses. On the PF task itself, a sufficiently parallelized CPU solver or gpusim2grid matches or exceeds the throughput of the ML surrogates we test while remaining orders of magnitude more accurate; we find no evidence that these GNN-style surrogates are yet competitive for PF specifically, though prior work reports genuine gains on related but more combinatorial tasks such as optimal power flow or power grid control. Beyond this finding, we hope the benchmark suite, code and reference evaluator released at this https URL helps close a broader reproducibility gap in this space, where batched GPU-based PF solvers are rarely open-sourced or evaluated against a common set of baselines.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Software Engineering (cs.SE).
Pagina del lavoro: https://arxiv.org/abs/2610.27930 — 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-21T07:06:13.127Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).