Track reconstruction as a service for collider physics
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915190490005504 |
|---|---|
| author | Zhao, Haoran Chou, Yuan-Tang Yao, Yao Ju, Xiangyang Feng, Yongbin McCormack, William Patrick Cochran-Branson, Miles Schulte, Jan-Frederik Liu, Miaoyuan Duarte, Javier Harris, Philip Hsu, Shih-Chieh Pedro, Kevin Tran, Nhan |
| author_facet | Zhao, Haoran Chou, Yuan-Tang Yao, Yao Ju, Xiangyang Feng, Yongbin McCormack, William Patrick Cochran-Branson, Miles Schulte, Jan-Frederik Liu, Miaoyuan Duarte, Javier Harris, Philip Hsu, Shih-Chieh Pedro, Kevin Tran, Nhan |
| contents | Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa$.$TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_05520 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Track reconstruction as a service for collider physics Zhao, Haoran Chou, Yuan-Tang Yao, Yao Ju, Xiangyang Feng, Yongbin McCormack, William Patrick Cochran-Branson, Miles Schulte, Jan-Frederik Liu, Miaoyuan Duarte, Javier Harris, Philip Hsu, Shih-Chieh Pedro, Kevin Tran, Nhan Instrumentation and Detectors Distributed, Parallel, and Cluster Computing High Energy Physics - Experiment Optimizing charged-particle track reconstruction algorithms is crucial for efficient event reconstruction in Large Hadron Collider (LHC) experiments due to their significant computational demands. Existing track reconstruction algorithms have been adapted to run on massively parallel coprocessors, such as graphics processing units (GPUs), to reduce processing time. Nevertheless, challenges remain in fully harnessing the computational capacity of coprocessors in a scalable and non-disruptive manner. This paper proposes an inference-as-a-service approach for particle tracking in high energy physics experiments. To evaluate the efficacy of this approach, two distinct tracking algorithms are tested: Patatrack, a rule-based algorithm, and Exa$.$TrkX, a machine learning-based algorithm. The as-a-service implementations show enhanced GPU utilization and can process requests from multiple CPU cores concurrently without increasing per-request latency. The impact of data transfer is minimal and insignificant compared to running on local coprocessors. This approach greatly improves the computational efficiency of charged particle tracking, providing a solution to the computing challenges anticipated in the High-Luminosity LHC era. |
| title | Track reconstruction as a service for collider physics |
| topic | Instrumentation and Detectors Distributed, Parallel, and Cluster Computing High Energy Physics - Experiment |
| url | https://arxiv.org/abs/2501.05520 |