Preparing the track reconstruction in ATLAS for a high multiplicity future

20th International Conference on Computing in High Energy and Nuclear Physics

物理学;计算机科学

Langenberg, Robert^1,2 ; Morley, Anthony^3 ; Salzburger, Andreas^2 ; Elsing, Markus^2 ; Eldik, Niels Van^2 ; Mashinistov, Ruslan^4

Technische Universität München, Institut für Informatik, Garching

85748, Germany^1

CERN, Genève 23

CH-1211, Switzerland^2

KTH Royal Institute of Technology, Department of Physics, Stockholm

SE-10691, Sweden^3

Russian Academy of Sciences, Lebedev Institute of Physics, 53 Leninskij Prospekt, Moscow

119991, Russia^4

关键词: ATLAS experiment;    Computational aspects;    Core components;    High multiplicity;    Interface complexity;    Reconstruction algorithms;    Removing algorithms;    Track reconstruction;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/513/2/022018/pdf
DOI  :  10.1088/1742-6596/513/2/022018

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

The track reconstruction algorithms of the ATLAS experiment have demonstrated excellent performance in all of the data delivered so far by the LHC. The expected large increase in the number of interactions per bunch crossing introduces new challenges both in the computational aspects and physics performance of the algorithms. With the aim of taking advantage of modern CPU design and optimizing memory and CPU usage in the reconstruction algorithms a number of projects are being pursued. These include rationalization of the event data model, vectorization of the core components of the algorithms, and removing algorithm bottlenecks by using modern code analysis tools. Recent results of the advances made in these ongoing projects indicate up to three-fold speedup in the optimized modules while in some modules the code size could be reduced by up to 97% leading to higher readability, maintainability and decreased interface complexity.