Online Tracking Algorithms on GPUs for the P̅ANDA Experiment at FAIR. Issue 8 (December 2015)

• Record Type: Journal Article
• Authors: Bianchi, L; Herten, A; Ritman, J; Stockmanns, T; Adinetz, A.; Kraus, J; Pleiter, D
• Is Part Of: Journal of physics. Volume 664:Issue 8(2015)
• Publication Date: 2015-12
• Subjects: Physics -- Congresses; 530.5
• DOI: 10.1088/1742-6596/664/8/082006
• Languages: English
• ISSNs: 1742-6588

Abstract

Abstract: 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.