CMS reconstruction improvements for the tracking in large pileup events

21st International Conference on Computing in High Energy and Nuclear Physics

物理学;计算机科学

Rovere, M.^1

CERN, Geneva, Switzerland^1

关键词: Bunch crossings;    Code optimization;    Future applications;    Occupancy conditions;    Particle trajectories;    Secondary vertices;    Software techniques;    Speed improvement;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/664/7/072040/pdf
DOI  :  10.1088/1742-6596/664/7/072040

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

来源: IOP

【 摘 要 】

The CMS tracking code is organized in several levels, known as iterative steps, each optimized to reconstruct a class of particle trajectories, as the ones of particles originating from the primary vertex or displaced tracks from particles resulting from secondary vertices. Each iterative step consists of seeding, pattern recognition and fitting by a kalman filter, and a final filtering and cleaning. Each subsequent step works on hits not yet associated to a reconstructed particle trajectory. The CMS tracking code is continuously evolving to make the reconstruction computing load compatible with the increasing instantaneous luminosity of LHC, resulting in a large number of primary vertices and tracks per bunch crossing. The major upgrade put in place during the present LHC Long Shutdown will allow the tracking code to comply with the conditions expected during RunII and the much larger pileup. In particular, new algorithms that are intrinsically more robust in high occupancy conditions were developed, iterations were re-designed (including new ones, dedicated to specific physics objects), code optimizations were deployed and new software techniques were used. The speed improvement has been achieved without significant reduction in term of physics performance. The methods and the results are presented and the prospects for future applications are discussed.