Speaker
Description
The upgrade of the Large Hadron Collider (LHC) to the High-Luminosity LHC (HL-LHC) will increase the number of proton-proton collisions by several-fold, and thus place a large demand on computing resources for charged particle tracking. The Line Segment Tracking (LST) algorithm is a novel, highly parallelizable algorithm that can run efficiently on GPUs and has been integrated into the CMS software to enable the reconstruction of displaced tracks in the high pileup scenarios of the HL-LHC. LST is designed to build track candidate objects using only outer tracker hits, naturally allowing for high acceptance of displaced track signatures. In the current Phase-2 reconstruction before LST, displaced tracking ends at an impact parameter of ~1 mm. Recently shown LST results confirmed enhanced efficiency for displaced tracks on simplified or general simulated collision events, extending the tracking coverage by an order of magnitude. In this work, we present an improved LST implementation focused on extending the reconstruction of displaced tracks and evaluate its performance in several BSM benchmarks, doubling the range of displacement where tracks are reconstructed.