Early Track Elimination in GPU Accelerated Algorithms for Track Finding in Particle Physics

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F25%3A00389171" target="_blank" >RIV/68407700:21240/25:00389171 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21670/25:00389171

Result on the web

<a href="https://doi.org/10.1109/HPCC67675.2025.00044" target="_blank" >https://doi.org/10.1109/HPCC67675.2025.00044</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/HPCC67675.2025.00044" target="_blank" >10.1109/HPCC67675.2025.00044</a>

Result language

angličtina

Original language name

Early Track Elimination in GPU Accelerated Algorithms for Track Finding in Particle Physics

Original language description

Track finding in particle physics has been an increasing challenge over the past decades because the intensities of collisions in state-of-the-art particle colliders have increased enormously. The particle physics experiments ATLAS and CMS at the CERN LHC have been recording data since 2010. The analysis of the data includes finding the particle tracks. For this, dedicated track reconstruction algorithms were developed and applied. One of the track reconstruction steps is the track finding. For this, track seeds are determined and the tracks are successively reconstructed by adding more measurements. The track finding becomes more complex with an increasing number of concurrently existing tracks created by particles that need to be reconstructed. In the past decade, the intensities of the proton-proton collisions at the LHC increased by more than a factor of ten. The time needed for the track finding increased exponentially due to its combinatorial complexity. The next major challenge for track finding will be the HLLHC operation, with an anticipated 200 concurrent collisions every 25 nanoseconds compared to the current 60 collisions. In this paper, we explain the main ideas of the state-of-the-art GPU-accelerated implementation of the track finding algorithm and describe several optimisations focusing on an early elimination of fake tracks. We compared the time needed to find all concurrently existing tracks of the optimised version with the baseline algorithm. The optimisations reduced the wall time by up to 15 % and the GPU memory requirements by up to 65 % for the anticipated collision rate.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

2025 IEEE International Conference on High Performance Computing and Communications (HPCC)

ISBN

979-8-3315-6874-0

ISSN

—

e-ISSN

—

Number of pages

7

Pages from-to

194-200

Publisher name

IEEE

Place of publication

Piscataway

Event location

Exeter

Event date

Aug 13, 2025

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—