This title appears in the Scientific Report :
2017
Please use the identifier:
http://dx.doi.org/10.1088/1742-6596/898/7/072040 in citations.
Please use the identifier: http://hdl.handle.net/2128/16289 in citations.
Parallel Algorithms for Online Track Finding for the $\bar{{\rm{P}}}$ANDA Experiment at FAIR
Parallel Algorithms for Online Track Finding for the $\bar{{\rm{P}}}$ANDA Experiment at FAIR
$\bar{{\rm{P}}}$ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. Unlike the majority of current experiments, $\bar{{\rm{P}}}$ANDA's strategy for data acquisition is based on online event reconstruction from free-streaming data, p...
Saved in:
Personal Name(s): | Bianchi, L. (Corresponding author) |
---|---|
Herten, A. / Ritman, J. / Stockmanns, T. | |
Contributing Institute: |
Experimentelle Hadronstruktur; IKP-1 |
Published in: | Journal of physics / Conference Series, 898 (2017) S. 072040 - |
Imprint: |
Bristol
IOP Publ.
2017
|
DOI: |
10.1088/1742-6596/898/7/072040 |
Document Type: |
Journal Article |
Research Program: |
FAIR Detector technology and systems |
Link: |
OpenAccess OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://hdl.handle.net/2128/16289 in citations.
$\bar{{\rm{P}}}$ANDA is a future hadron and nuclear physics experiment at the FAIR facility in construction in Darmstadt, Germany. Unlike the majority of current experiments, $\bar{{\rm{P}}}$ANDA's strategy for data acquisition is based on online event reconstruction from free-streaming data, performed in real time entirely by software algorithms using global detector information. This paper reports on the status of the development of algorithms for the reconstruction of charged particle tracks, targeted towards online data processing applications, designed for execution on data-parallel processors such as GPUs (Graphic Processing Units). Two parallel algorithms for track finding, derived from the Circle Hough algorithm, are being developed to extend the parallelism to all stages of the algorithm. The concepts of the algorithms are described, along with preliminary results and considerations about their implementations and performance |