Performance portable batched linear algebra kernels for transport sweeps using Kokkos

This paper describes the development of performance portable batched linear algebra kernels for SN-DG neutron transport sweeps using Kokkos. We establish a new sweep algorithm for GPUs that relies on batched linear algebra kernels. We implement an optimized batched gesv solver for small linear systems that builds upon state-of-the-art algorithms. Our implementation achieves high performance by minimizing global memory traffic and maximizing the amount of computations done at compile-time. We assess the performance of the batched gesv kernel on NVIDIA and AMD GPUs. We show that our custom implementation outperforms state-of-the-art linear algebra libraries on these architectures. The performance of the new GPU sweep implementation is assessed on the H100 and MI300A GPUs. We demonstrate that it is able to achieve high performance on both architectures, and is competitive with an optimized multithreaded CPU implementation on a 128-core AMD Genoa CPU node.

Authors

Institutions

Publication Details

Published
2025-11-07
DOI
https://doi.org/10.1145/3731599.3767491
Citations
1
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
2.27
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Performance portable batched linear algebra kernels for transport sweeps using Kokkos

Ansar Calloo, R. Le Tellier, Gabriel Suau, Thierry Gautier et al.
1 citations
Parallel Computing and Optimization Techniques
2.27
article

Performance portable batched linear algebra kernels for transport sweeps using Kokkos

Ansar Calloo, R. Le Tellier, Gabriel Suau, Thierry Gautier, Rémi Baron
article en
1 citations

Abstract

This paper describes the development of performance portable batched linear algebra kernels for SN-DG neutron transport sweeps using Kokkos. We establish a new sweep algorithm for GPUs that relies on batched linear algebra kernels. We implement an optimized batched gesv solver for small linear systems that builds upon state-of-the-art algorithms. Our implementation achieves high performance by minimizing global memory traffic and maximizing the amount of computations done at compile-time. We assess the performance of the batched gesv kernel on NVIDIA and AMD GPUs. We show that our custom implementation outperforms state-of-the-art linear algebra libraries on these architectures. The performance of the new GPU sweep implementation is assessed on the H100 and MI300A GPUs. We demonstrate that it is able to achieve high performance on both architectures, and is competitive with an optimized multithreaded CPU implementation on a 128-core AMD Genoa CPU node.

École Normale Supérieure de Lyon (FR), Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR), Université Paris-Saclay (FR), CEA Cadarache (FR), Maison de la Simulation (FR), Direction des Energies (FR), CEA Paris-Saclay (FR), Avalon Pharma (United States) (US)
Openalex Percentile: Top 10%
Parallel Computing and Optimization Techniques
2.27
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.