You are on page 1of 1

Matter and the Universe

Andreas Herten (FZJ, Ruhr University Bochum)

Topic 2: Cosmic Matter in the Laboratory

Online Tracking on Graphics Processing Units for PANDA
Motivation: PANDA's Demand for High Performance Computing
Online Tracking
200  GB/s

PANDA Experiment

GPU Parallel Processing

1 /1 000 200  MB/s

3  PB/a


Antiproton proton experiment At FAIR, Darmstadt

No hardware trigger

Tracking as data reduction criterion

GPU Algorithms
Riemann Track Finder Hough Transform Triplet Finder

rij = xi cos(αj ) + yi sin(αj ) + ρi

Map hits onto Riemann surface Calculate plane for track seeds Re-map to x-y plane GPU Optimizations
• Reduce number of track seeds • Reduce number of hits potentially combined with track seeds

Conformal mapping of hits Calculate Hough trajectories Find peaks GPU Optimizations
• Dynamic grid size • Recursive kernel calls

Create triplets Combine to track Associate hits GPU Optimizations • Reduce scaling with number of hits
from O(n 2) to O(n) – bunching
Collaboration with NVIDIA Application Lab

Different GPU-specific optimizations Riemann: Up to 1 00x faster than CPU version Development of additional GPU tools for other algorithms: Algorithm Speed Efficiency bunching wrapper ☺ Riemann 500  µs/event Hough 500  µs/event Triplet Finder 20  µs/event
Triplet Finder

Conclusions & Outlook
Conclusions • Three tracking algorithms implemented on GPU • Performance of Triplet Finder algorithm: Achieved on single GPU: 6·1 0 6 hits/s Total required: 1 0 9 hits/s → Feasible with multi-GPU system Outlook • Optimize speed of Riemann & Hough • Optimize efficiency of Triplet Finder • Study performance with physics channels • Implement PANDA-DAQ data transfer to GPU