Software Performance of the ATLAS Track Reconstruction for LHC Run 3

• Autor: Aad, G ; Abbott, B ; Abeling, K ; Abicht, NJ ; Abidi, SH ; Aboulhorma, A ; Abramowicz, H ; Abreu, H ; Abulaiti, Y ; Acharya, BS ; Bourdarios, CA ; Adamczyk, L ; Adamek, L ; Addepalli, SV ; Addison, MJ ; Adelman, J ; Adiguzel, A ; Adye, T ; Affolder, AA ; Afik, Y ; Agaras, MN ; Agarwala, J ; Aggarwal, A ; Agheorghiesei, C ; Ahmad, A ; Ahmadov, F ; Ahmed, WS ; Ahuja, S ; Ai, X ; Aielli, G ; Aikot, A ; Tamlihat, MA ; Aitbenchikh, B ; Aizenberg, I ; Akbiyik, M ; Åkesson, TPA ; Akimov, AV ; Akiyama, D ; Akolkar, NN ; Khoury, KA ; Alberghi, GL ; Albert, J ; Albicocco, P ; Albouy, GL ; Alderweireldt, S ; Aleksa, M ; Aleksandrov, IN ; Alexa, C ; Alexopoulos, T ; Alfonsi, F ; Algren, M ; Alhroob, M ; Ali, B ; Ali, HMJ ; Ali, S ; Alibocus, SW ; Aliev, M ; Alimonti, G ; Alkakhi, W ; Allaire, C ; Allbrooke, BMM ; Allen, JF ; Flores, CAA ; Allport, PP ; Aloisio, A ; Alonso, F ; Alpigiani, C ; Estevez, MA ; Fernandez, AA ; Cardoso, MA ; Alviggi, MG ; Aly, M ; Coutinho, YA ; Ambler, A ; Amelung, C ; Amerl, M ; Ames, CG ; Amidei, D ; Santos, SPAD ; Amos, KR ; Ananiev, V ; Anastopoulos, C ; Andeen, T ; Anders, JK ; Andrean, SY ; Andreazza, A ; Angelidakis, S ; Angerami, A ; Anisenkov, AV ; Annovi, A ; Antel, C ; Anthony, MT ; Antipov, E ; Antonelli, M ; Anulli, F ; Aoki, M ; Aoki, T ; Pozo, JAA ; Aparo, MA ; Bella, LA
• Assuntos: 46 Information and Computing Sciences ; 4612 Software Engineering ; 51 Physical Sciences ; Bioengineering
• Descrição: Acknowledgements: We thank CERN for the very successful operation of the LHC, as well as the support staff from our institutions without whom ATLAS could not be operated efficiently. We acknowledge the support of ANPCyT, Argentina; YerPhI, Armenia; ARC, Australia; BMWFW and FWF, Austria; ANAS, Azerbaijan; CNPq and FAPESP, Brazil; NSERC, NRC and CFI, Canada; CERN; ANID, Chile; CAS, MOST and NSFC, China; Minciencias, Colombia; MEYS CR, Czech Republic; DNRF and DNSRC, Denmark; IN2P3-CNRS and CEA-DRF/IRFU, France; SRNSFG, Georgia; BMBF, HGF and MPG, Germany; GSRI, Greece; RGC and Hong Kong SAR, China; ISF and Benoziyo Center, Israel; INFN, Italy; MEXT and JSPS, Japan; CNRST, Morocco; NWO, Netherlands; RCN, Norway; MEiN, Poland; FCT, Portugal; MNE/IFA, Romania; MESTD, Serbia; MSSR, Slovakia; ARRS and MIZŠ, Slovenia; DSI/NRF, South Africa; MICINN, Spain; SRC and Wallenberg Foundation, Sweden; SERI, SNSF and Cantons of Bern and Geneva, Switzerland; MOST, Taiwan; TENMAK, Türkiye; STFC, United Kingdom; DOE and NSF, United States of America. In addition, individual groups and members have received support from BCKDF, CANARIE, Compute Canada and CRC, Canada; PRIMUS 21/SCI/017 and UNCE SCI/013, Czech Republic; COST, ERC, ERDF, Horizon 2020 and Marie Skłodowska-Curie Actions, European Union; Investissements d’Avenir Labex, Investissements d’Avenir Idex and ANR, France; DFG and AvH Foundation, Germany; Herakleitos, Thales and Aristeia programmes co-financed by EU-ESF and the Greek NSRF, Greece; BSF-NSF and MINERVA, Israel; Norwegian Financial Mechanism 2014-2021, Norway; NCN and NAWA, Poland; La Caixa Banking Foundation, CERCA Programme Generalitat de Catalunya and PROMETEO and GenT Programmes Generalitat Valenciana, Spain; Göran Gustafssons Stiftelse, Sweden; The Royal Society and Leverhulme Trust, United Kingdom. The crucial computing support from all WLCG partners is acknowledged gratefully, in particular from CERN, the ATLAS Tier-1 facilities at TRIUMF (Canada), NDGF (Denmark, Norway, Sweden), CC-IN2P3 (France), KIT/GridKA (Germany), INFN-CNAF (Italy), NL-T1 (Netherlands), PIC (Spain), ASGC (Taiwan), RAL (UK) and BNL (USA), the Tier-2 facilities worldwide and large non-WLCG resource providers. Major contributors of computing resources are listed in Ref. [42]. <jats:title>Abstract</jats:title><jats:p>Charged particle reconstruction in the presence of many simultaneous proton–proton (<jats:inline-formula><jats:alternatives><jats:tex-math> {} p lt;/jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mrow /> <mml:mi>p</mml:mi> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula>) 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 <jats:inline-formula><jats:alternatives><jats:tex-math> {} p lt;/jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>p</mml:mi> <mml:mrow /> <mml:mi>p</mml:mi> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> 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 <jats:inline-formula><jats:alternatives><jats:tex-math> 0~p {} p lt;/jats:tex-math><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>60</mml:mn> <mml:mspace /> <mml:mi>p</mml:mi> <mml:mrow /> <mml:mi>p</mml:mi> </mml:mrow> </mml:math></jats:alternatives></jats:inline-formula> 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.</jats:p>
  
• Editor: Springer Science and Business Media LLC
  
• Data de criação/publicação: 2024-12
  
• Idioma: Inglês