Workshop „Physics Opportunities with Proton Beams at SIS100” was held in Wuppertal
PANDA meetings
04/03-08/03 2024 CM 24/1 in Münster
24/06-28/06 2024 CM 24/2 at GSI
25/06-26/06 2024 FEE/DAQ Workshop
04/11-06/11 2024 CM 24/3 at GSI
05/03-07/03 2025 WS at GSI
16/06-20/06 2025 CM 25 in Uppsala
Online Tracking Algorithms on GPUs for the PANDA Experiment at FAIR
L. Bianchi, A. Herten, J. Ritman, T. Stockmanns
PA-PRO-2015-004.pdf
(930.96 KB)
PANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast with the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction and selection from free-streaming data, performed in real time entirely by software algorithms using global detector information.
This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized for use in online data processing applications, using General-Purpose Graphic Processing Units.
Two algorithms for trackfinding, the Triplet Finder and the Circle Hough are described, with details of their GPU implementations. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of-the-art computing-grade GPU cards.
In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented.
This paper reports the status of the development of algorithms for the reconstruction of charged particle tracks, optimized for use in online data processing applications, using General-Purpose Graphic Processing Units.
Two algorithms for trackfinding, the Triplet Finder and the Circle Hough are described, with details of their GPU implementations. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of-the-art computing-grade GPU cards.
In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented.