Triplet Finder: On the way to triggerless online reconstruction with GPUs for the P¯ANDA experiment

•We propose improvements to the Triplet Finder, an online track reconstruction algorithm for the P¯ANDA experiment.•We present a GPU implementation of the algorithm and describe platform specific optimizations.•We present performance analyses for our implementation and demonstrate that processing ti...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational science Vol. 10; pp. 317 - 326
Main Authors: Adinetz, Andrew, Herten, Andreas, Kraus, Jiri, Mertens, Marius C., Pleiter, Dirk, Stockmanns, Tobias, Wintz, Peter
Format: Journal Article
Language:English
Published: Elsevier B.V 01-09-2015
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•We propose improvements to the Triplet Finder, an online track reconstruction algorithm for the P¯ANDA experiment.•We present a GPU implementation of the algorithm and describe platform specific optimizations.•We present performance analyses for our implementation and demonstrate that processing times of 120ns/hit can be achieved on a single GPU. P¯ANDA is a state-of-the-art hadron physics experiment currently under construction at FAIR, Darmstadt. In order to select events for offline analysis, P¯ANDA will use a software-based triggerless online reconstruction, performed with a data rate of 200GB/s. To process the raw data rate of the detector in realtime, we design and implement a GPU version of the Triplet Finder, a fast and robust first-stage tracking algorithm able to reconstruct tracks with good quality, specially designed for the Straw Tube Tracker sub-detector of P¯ANDA. We reduce the algorithmic complexity of processing many hits together by splitting them into bunches, which can be processed independently. We evaluate different ways of processing bunches, GPU dynamic parallelism being one of them. We also propose an optimized technique for associating hits with reconstructed track candidates. The evaluation of our GPU implementation demonstrates that the Triplet Finder can process more than 8Mhits/s on a single K20X GPU, making it a promising algorithm for the online event filtering scheme of P¯ANDA.
ISSN:1877-7503
1877-7511
DOI:10.1016/j.jocs.2015.03.010