Metraipolis › archive › dc_3112345cd4db
Multi-GPU Acceleration of Interface Problems in FEniCS, with Application to Cardiac Modeling — arXiv:2611.03181
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03181
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:26:53.171Z
- SHA-256 of the archived text
fcc518e7730a9af7a8d2a2a1136d68f8539ef7cae8d42a462692bee03a2f4aba- Stable URL of this page
https://metraipolis.com/documento/dc_3112345cd4db
How to cite
Multi-GPU Acceleration of Interface Problems in FEniCS, with Application to Cardiac Modeling — arXiv:2611.03181 — arXiv (en), https://arxiv.org/abs/2611.03181 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3112345cd4db (Metraipolis archive dc_3112345cd4db, sha256 fcc518e7730a9af7a8d2a2a1136d68f8539ef7cae8d42a462692bee03a2f4aba)
BibTeX
@misc{dc3112345cd4db,
title = {Multi-GPU Acceleration of Interface Problems in FEniCS, with Application to Cardiac Modeling — arXiv:2611.03181},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03181},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3112345cd4db; sha256 fcc518e7730a9af7a8d2a2a1136d68f8539ef7cae8d42a462692bee03a2f4aba},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03181. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
GPU acceleration of finite element assembly is well established for standard formulations, but mixed-dimensional problems, in which volumetric subdomains are coupled via lower-dimensional interfaces, remain unsupported in automated frameworks such as FEniCS. We extend cuDOLFINx, a GPU-enabled extension of the DOLFINx finite element framework, to assemble such interface problems on GPUs while preserving the high-level FEniCS programming model. Combined with GPU-resident Krylov solvers and algebraic multigrid preconditioning, this enables end-to-end GPU execution of the EMI (Extracellular--Membrane--Intracellular) model, an elliptic interface problem from cardiac modeling in which many intracellular subdomains are coupled through membranes. We compare the GPU implementation against a CPU-based one through strong and weak scaling experiments on regular and realistic 3D cardiac geometries with up to 8000 cells and 22 million degrees of freedom. In terms of assembly, a single GH200 node is roughly equivalent to two 144-core CPU nodes in strong scaling, and to two to three nodes in weak scaling, depending on geometry. For the linear solver, performance depends on geometry, preconditioning, and problem scale. On the regular geometry, GPU advantages emerge mainly at larger problem sizes and node counts. On the realistic geometry, with the same algebraic multigrid preconditioner for both architectures, the GPU is faster at all tested scales. The implementation is available as open-source software and applies to other problems with interface coupling. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Numerical Analysis (math.NA) ; Distributed, Parallel, and Cluster Computing (cs.DC); Mathematical Software (cs.MS). Pagina del lavoro: https://arxiv.org/abs/2611.03181 — 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-03T18:10:22.864Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).