Charged particle reconstruction in the presence of many simultaneous proton–proton (pp) collisions in the LHC is a challenging task for the ATLAS experiment’s reconstruction software due to the combinatorial complexity. This paper describes the major changes made to adapt the software to reconstruct high-activity collisions with an average of 50 or more simultaneous pp interactions per bunch crossing (pile-up) promptly using the available computing resources. The performance of the key components of the track reconstruction chain and its dependence on pile-up are evaluated, and the improvement achieved compared to the previous software version is quantified. For events with an average of 60pp collisions per bunch crossing, the updated track reconstruction is twice as fast as the previous version, without significant reduction in reconstruction efficiency and while reducing the rate of combinatorial fake tracks by more than a factor two.

Software Performance of the ATLAS Track Reconstruction for LHC Run 3 / Aad, G., Abbott, B., Abeling, K., Abicht, N.J., Abidi, S.H., Aboulhorma, A., Abramowicz, H., Abreu, H., Abulaiti, Y., Acharya, B.S., Bourdarios, C.A., Adamczyk, L., Adamek, L., Addepalli, S.V., Addison, M.J., Adelman, J., Adiguzel, A., Adye, T., Affolder, A.A., Afik, Y., et al.. - In: COMPUTING AND SOFTWARE FOR BIG SCIENCE. - ISSN 2510-2044. - 8:1(2024). [10.1007/s41781-023-00111-y]

Software Performance of the ATLAS Track Reconstruction for LHC Run 3

Follega F. M.;Iuppa R.;Ricci E.;
2024-01-01

Abstract

Charged particle reconstruction in the presence of many simultaneous proton–proton (pp) collisions in the LHC is a challenging task for the ATLAS experiment’s reconstruction software due to the combinatorial complexity. This paper describes the major changes made to adapt the software to reconstruct high-activity collisions with an average of 50 or more simultaneous pp interactions per bunch crossing (pile-up) promptly using the available computing resources. The performance of the key components of the track reconstruction chain and its dependence on pile-up are evaluated, and the improvement achieved compared to the previous software version is quantified. For events with an average of 60pp collisions per bunch crossing, the updated track reconstruction is twice as fast as the previous version, without significant reduction in reconstruction efficiency and while reducing the rate of combinatorial fake tracks by more than a factor two.
2024
1
Aad, G.; Abbott, B.; Abeling, K.; Abicht, N. J.; Abidi, S. H.; Aboulhorma, A.; Abramowicz, H.; Abreu, H.; Abulaiti, Y.; Acharya, B. S.; Bourdarios, C....espandi
Software Performance of the ATLAS Track Reconstruction for LHC Run 3 / Aad, G., Abbott, B., Abeling, K., Abicht, N.J., Abidi, S.H., Aboulhorma, A., Abramowicz, H., Abreu, H., Abulaiti, Y., Acharya, B.S., Bourdarios, C.A., Adamczyk, L., Adamek, L., Addepalli, S.V., Addison, M.J., Adelman, J., Adiguzel, A., Adye, T., Affolder, A.A., Afik, Y., et al.. - In: COMPUTING AND SOFTWARE FOR BIG SCIENCE. - ISSN 2510-2044. - 8:1(2024). [10.1007/s41781-023-00111-y]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/412291
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? ND
  • OpenAlex 23
social impact