TY - JOUR

T1 - Software Performance of the ATLAS Track Reconstruction for LHC Run 3

AU - The ATLAS collaboration

AU - Barton, A.E.

AU - Bertram, I.A.

AU - Borissov, G.

AU - Bouhova-Thacker, E.V.

AU - Ferguson, R.A.M.

AU - Ferrando, James

AU - Fox, H.

AU - Henderson, R.C.W.

AU - Jones, R.W.L.

AU - Kartvelishvili, V.

AU - Love, P.A.

AU - Marshall, E.J.

AU - Meng, L.

AU - Muenstermann, D.

AU - Ribaric, N.

AU - Rybacki, K.

AU - Smizanska, M.

AU - Spinali, S.

AU - Wharton, A.M.

N1 - M1 - 9

PY - 2024/4/2

Y1 - 2024/4/2

N2 - Charged particle reconstruction in the presence of many simultaneous proton–proton ($$p {} p $$ p p ) 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 $$p {} p $$ p p 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 $$60~p {} p $$ 60 p p 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.

AB - Charged particle reconstruction in the presence of many simultaneous proton–proton ($$p {} p $$ p p ) 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 $$p {} p $$ p p 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 $$60~p {} p $$ 60 p p 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.

U2 - 10.1007/s41781-023-00111-y

DO - 10.1007/s41781-023-00111-y

M3 - Journal article

VL - 8

JO - Computing and Software for Big Science

JF - Computing and Software for Big Science

SN - 2510-2036

IS - 1

M1 - 9

ER -