Online Event Selection for Mu3e using GPUs
Valentin Henkys, Bertil Schmidt, Niklaus Berger

TL;DR
This paper presents a GPU-based online event selection algorithm for the Mu3e experiment, significantly reducing data rates while accurately reconstructing signal events at high muon rates.
Contribution
It introduces a three-step GPU algorithm that efficiently filters and reconstructs events, enabling real-time data reduction for high-rate muon experiments.
Findings
Reduces data rate by a factor of 200
Reconstructs over 97% of signal tracks
Identifies over 94% of signal events accurately
Abstract
In the search for physics beyond the Standard Model the Mu3e experiment tries to observe the lepton flavor violating decay . By observing the decay products of /s it aims to either observe the process, or set a new upper limit on its estimated branching ratio. The high muon rates result in high data rates of \,Gbps, dominated by data produced through background processes. We present the Online Event Selection, a three step algorithm running on the graphics processing units (GPU) of the Mu3e filter farm computers. By using simple and fast geometric selection criteria, the algorithm first reduces the amount of possible event candidates to below of the initial set. These candidates are then used to reconstruct full particle tracks, correctly reconstructing over of signal tracks. Finally a possible decay vertex is…
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.
