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.
Original language | English |
---|---|
Article number | 9 |
Pages (from-to) | 1-32 |
Number of pages | 32 |
Journal | Computing and Software for Big Science |
Volume | 8 |
Issue number | 1 |
DOIs | |
Publication status | Published - Dec 2024 |
Externally published | Yes |
Bibliographical note
Copyright the Author(s) 2024. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver
}
In: Computing and Software for Big Science, Vol. 8, No. 1, 9, 12.2024, p. 1-32.
Research output: Contribution to journal › Article › peer-review
TY - JOUR
T1 - Software performance of the ATLAS track reconstruction for LHC Run 3
AU - The ATLAS Collaboration
AU - Aad, G.
AU - Abbott, B.
AU - Abeling, K.
AU - Abicht, N. J.
AU - Abidi, S. H.
AU - Aboulhorma, A.
AU - Abramowicz, H.
AU - Abreu, H.
AU - Abulaiti, Y.
AU - Acharya, B. S.
AU - Bourdarios, C. Adam
AU - Adamczyk, L.
AU - Adamek, L.
AU - Addepalli, S. V.
AU - Addison, M. J.
AU - Adelman, J.
AU - Adiguzel, A.
AU - Adye, T.
AU - Affolder, A. A.
AU - Afik, Y.
AU - Agaras, M. N.
AU - Agarwala, J.
AU - Aggarwal, A.
AU - Agheorghiesei, C.
AU - Ahmad, A.
AU - Ahmadov, F.
AU - Ahmed, W. S.
AU - Ahuja, S.
AU - Ai, X.
AU - Aielli, G.
AU - Aikot, A.
AU - Tamlihat, M. Ait
AU - Aitbenchikh, B.
AU - Aizenberg, I.
AU - Akbiyik, M.
AU - Åkesson, T. P.A.
AU - Akimov, A. V.
AU - Akiyama, D.
AU - Akolkar, N. N.
AU - Khoury, K. Al
AU - Alberghi, G. L.
AU - Albert, J.
AU - Albicocco, P.
AU - Albouy, G. L.
AU - Alderweireldt, S.
AU - Aleksa, M.
AU - Aleksandrov, I. N.
AU - Alexa, C.
AU - Alexopoulos, T.
AU - Alfonsi, F.
AU - Algren, M.
AU - Alhroob, M.
AU - Ali, B.
AU - Ali, H. M.J.
AU - Ali, S.
AU - Alibocus, S. W.
AU - Aliev, M.
AU - Alimonti, G.
AU - Alkakhi, W.
AU - Allaire, C.
AU - Allbrooke, B. M.M.
AU - Allen, J. F.
AU - Flores, C. A.Allendes
AU - Allport, P. P.
AU - Aloisio, A.
AU - Alonso, F.
AU - Alpigiani, C.
AU - Estevez, M. Alvarez
AU - Fernandez, A. Alvarez
AU - Cardoso, M. Alves
AU - Alviggi, M. G.
AU - Aly, M.
AU - Coutinho, Y. Amaral
AU - Ambler, A.
AU - Amelung, C.
AU - Amerl, M.
AU - Ames, C. G.
AU - Amidei, D.
AU - Santos, S. P.Amor Dos
AU - Amos, K. R.
AU - Ananiev, V.
AU - Anastopoulos, C.
AU - Andeen, T.
AU - Anders, J. K.
AU - Andrean, S. Y.
AU - Andreazza, A.
AU - Angelidakis, S.
AU - Angerami, A.
AU - Anisenkov, A. V.
AU - Annovi, A.
AU - Antel, C.
AU - Anthony, M. T.
AU - Antipov, E.
AU - Antonelli, M.
AU - Anulli, F.
AU - Aoki, M.
AU - Aoki, T.
AU - Pozo, J. A.Aparisi
AU - Aparo, M. A.
AU - Bella, L. Aperio
AU - Appelt, C.
AU - Apyan, A.
AU - Aranzabal, N.
AU - Val, S. J.Arbiol
AU - Arcangeletti, C.
AU - Arce, A. T.H.
AU - Arena, E.
AU - Arguin, J. F.
AU - Argyropoulos, S.
AU - Arling, J. H.
AU - Arnaez, O.
AU - Arnold, H.
AU - Artoni, G.
AU - Asada, H.
AU - Asai, K.
AU - Asai, S.
AU - Asbah, N. A.
AU - Assahsah, J.
AU - Assamagan, K.
AU - Astalos, R.
AU - Atashi, S.
AU - Atkin, R. J.
AU - Atkinson, M.
AU - Atmani, H.
AU - Atmasiddha, P. A.
AU - Augsten, K.
AU - Auricchio, S.
AU - Auriol, A. D.
AU - Austrup, V. A.
AU - Avolio, G.
AU - Axiotis, K.
AU - Azuelos, G.
AU - Babal, D.
AU - Bachacou, H.
AU - Bachas, K.
AU - Bachiu, A.
AU - Backman, F.
AU - Badea, A.
AU - Bagnaia, P.
AU - Bahmani, M.
AU - Bailey, A. J.
AU - Bailey, V. R.
AU - Baines, J. T.
AU - Baines, L.
AU - Baker, O. K.
AU - Bakos, E.
AU - Gupta, D. Bakshi
AU - Balakrishnan, V.
AU - Balasubramanian, R.
AU - Baldin, E. M.
AU - Balek, P.
AU - Ballabene, E.
AU - Balli, F.
AU - Baltes, L. M.
AU - Balunas, W. K.
AU - Balz, J.
AU - Banas, E.
AU - Bandieramonte, M.
AU - Bandyopadhyay, A.
AU - Bansal, S.
AU - Barak, L.
AU - Barakat, M.
AU - Barberio, E. L.
AU - Barberis, D.
AU - Barbero, M.
AU - Barel, M. Z.
AU - Barends, K. N.
AU - Barillari, T.
AU - Barisits, M. S.
AU - Barklow, T.
AU - Baron, P.
AU - Moreno, D. A.Baron
AU - Baroncelli, A.
AU - Barone, G.
AU - Barr, A. J.
AU - Barr, J. D.
AU - Navarro, L. Barranco
AU - Barreiro, F.
AU - da Costa, J. Barreiro Guimarães
AU - Barron, U.
AU - Teixeira, M. G.Barros
AU - Barsov, S.
AU - Bartels, F.
AU - Bartoldus, R.
AU - Barton, A. E.
AU - Bartos, P.
AU - Basan, A.
AU - Baselga, M.
AU - Bassalat, A.
AU - Basso, M. J.
AU - Basson, C. R.
AU - Bates, R. L.
AU - Batlamous, S.
AU - Batley, J. R.
AU - Batool, B.
AU - Battaglia, M.
AU - Battulga, D.
AU - Bauce, M.
AU - Bauer, M.
AU - Bauer, P.
AU - Hurrell, L. T.Bazzano
AU - Beacham, J. B.
AU - Beau, T.
AU - Beaucamp, J. Y.
AU - Beauchemin, P. H.
AU - Becherer, F.
AU - Bechtle, P.
AU - Beck, H. P.
AU - Becker, K.
AU - Beddall, A. J.
AU - Bednyakov, V. A.
AU - Bee, C. P.
AU - Beemster, L. J.
AU - Beermann, T. A.
AU - Begalli, M.
AU - Begel, M.
AU - Behera, A.
AU - Behr, J. K.
AU - Beirer, J. F.
AU - Beisiegel, F.
AU - Belfkir, M.
AU - Bella, G.
AU - Bellagamba, L.
AU - Bellerive, A.
AU - Bellos, P.
AU - Beloborodov, K.
AU - Benchekroun, D.
AU - Bendebba, F.
AU - Benhammou, Y.
AU - Benoit, M.
AU - Bensinger, J. R.
AU - Bentvelsen, S.
AU - Beresford, L.
AU - Beretta, M.
AU - Kuutmann, E. Bergeaas
AU - Berger, N.
AU - Bergmann, B.
AU - Beringer, J.
AU - Bernardi, G.
AU - Bernius, C.
AU - Bernlochner, F. U.
AU - Bernon, F.
AU - Berry, T.
AU - Berta, P.
AU - Berthold, A.
AU - Bertram, I. A.
AU - Bethke, S.
AU - Betti, A.
AU - Bevan, A. J.
AU - Shojaii, J.
N1 - Copyright the Author(s) 2024. Version archived for private and non-commercial use with the permission of the author/s and according to publisher conditions. For further rights please contact the publisher.
PY - 2024/12
Y1 - 2024/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85189516943&partnerID=8YFLogxK
U2 - 10.1007/s41781-023-00111-y
DO - 10.1007/s41781-023-00111-y
M3 - Article
AN - SCOPUS:85189516943
SN - 2510-2044
VL - 8
SP - 1
EP - 32
JO - Computing and Software for Big Science
JF - Computing and Software for Big Science
IS - 1
M1 - 9
ER -