Papers › GeantV: Results from the prototype of concurrent vector particle transport simulation in HEP
GeantV: Results from the prototype of concurrent vector particle transport simulation in HEP
G. Amadio, A. Ananya, J. Apostolakis, M. Bandieramonte, S. Banerjee, A. Bhattacharyya, C. Bianchini, G. Bitzes, P. Canal, F. Carminati, O. Chaparro-Amaro, G. Cosmo, J. C. De Fine Licht, V. Drogan, L. Duhem, D. Elvira, J. Fuentes, A. Gheata, M. Gheata, M. Gravey, I. Goulas, F. Hariri, S. Y. Jun, D. Konstantinov, H. Kumawat, J. G. Lima, A. Maldonado-Romo, J. Martínez-Castro, P. Mato, T. Nikitina, S. Novaes, M. Novak, K. Pedro, W. Pokorski, A. Ribon, R. Schmitz, R. Seghal, O. Shadura, E. Tcherniaev, S. Vallecorsa, S. Wenzel, Y. Zhang
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Full detector simulation was among the largest CPU consumer in all CERN experiment software stacks for the first two runs of the Large Hadron Collider (LHC). In the early 2010's, the projections were that simulation demands would scale linearly with luminosity increase, compensated only partially by an increase of computing resources. The extension of fast simulation approaches to more use cases, covering a larger fraction of the simulation budget, is only part of the solution due to intrinsic precision limitations. The remainder corresponds to speeding-up the simulation software by several factors, which is out of reach using simple optimizations on the current code base. In this context, the GeantV R&D project was launched, aiming to redesign the legacy particle transport codes in order to make them benefit from fine-grained parallelism features such as vectorization, but also from increased code and data locality. This paper presents extensively the results and achievements of this R&D, as well as the conclusions and lessons learnt from the beta prototype.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections