Kalman Filter Tracking on Parallel Architectures
Giuseppe Cerati, Peter Elmer, Steven Lantz, Kevin McDermott, Dan, Riley, Matev\v{z} Tadel, Peter Wittich, Frank W\"urthwein, Avi Yagil

TL;DR
This paper explores parallelizing Kalman Filter-based track reconstruction algorithms to leverage modern multi-core and vectorized architectures, aiming to improve performance for high-energy physics experiments like the HL-LHC.
Contribution
It demonstrates the development of an end-to-end track reconstruction algorithm optimized with vectorization and parallelization for realistic simulations.
Findings
Achieved significant speedup with vectorized Kalman Filter implementations.
Successfully parallelized the track reconstruction algorithm for modern architectures.
Enhanced performance in realistic simulation environments.
Abstract
Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors, but the future will be even more exciting. In order to stay within the power density limits but still obtain Moore's Law performance/price gains, it will be necessary to parallelize algorithms to exploit larger numbers of lightweight cores and specialized functions like large vector units. Example technologies today include Intel's Xeon Phi and GPGPUs. Track finding and fitting is one of the most computationally challenging problems for event reconstruction in particle physics. At the High Luminosity LHC, for example, this will be by far the dominant problem. The need for greater parallelism has driven investigations of very different track finding techniques including Cellular Automata or returning to Hough Transform.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
