This title appears in the Scientific Report :
2015
Please use the identifier:
http://hdl.handle.net/2128/9796 in citations.
Please use the identifier: http://dx.doi.org/10.1088/1742-6596/664/8/082006 in citations.
Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR
Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR
P̅ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction from free-streaming data, performed in real time entire...
Saved in:
Personal Name(s): | Bianchi, L. (Corresponding author) |
---|---|
Herten, A. (Corresponding author) / Ritman, J. / Stockmanns, T. / Adinetz, A. / Kraus, J. / Pleiter, D. | |
Contributing Institute: |
JARA-FAME; JARA-FAME Jülich Supercomputing Center; JSC Experimentelle Hadronstruktur; IKP-1 |
Published in: | Journal of physics / Conference Series, 664 (2015) 8, S. 082006 - |
Imprint: |
Bristol
IOP Publ.
2015
|
DOI: |
10.1088/1742-6596/664/8/082006 |
Document Type: |
Journal Article |
Research Program: |
Detector technology and systems FAIR Cosmic Matter in the Laboratory |
Link: |
OpenAccess OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://dx.doi.org/10.1088/1742-6596/664/8/082006 in citations.
P̅ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. In contrast to the majority of current experiments, PANDA's strategy for data acquisition is based on event reconstruction 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 online data processing applications, using General-Purpose Graphic Processing Units (GPU). Two algorithms for trackfinding, the Triplet Finder and the Circle Hough, are described, and details of their GPU implementations are highlighted. Average track reconstruction times of less than 100 ns are obtained running the Triplet Finder on state-of- the-art GPU cards. In addition, a proof-of-concept system for the dispatch of data to tracking algorithms using Message Queues is presented. |