110 likes | 200 Views
Status of LIT tracking. Andrey Lebedev 1,2 Claudia Höhne 1 Ivan Kisel 1 Gennady Ososkov 2. 15 th CBM Collaboration meeting April 12-16 , 20 10 GSI, Darmstadt. 1 GSI Helmholtzzentrum für Schwerionenforschung GmbH , Darmstadt , Germany
E N D
Status of LIT tracking Andrey Lebedev1,2 Claudia Höhne1 Ivan Kisel1 Gennady Ososkov2 15th CBM Collaboration meeting April12-16, 2010 GSI, Darmstadt 1 GSI Helmholtzzentrum für Schwerionenforschung GmbH, Darmstadt, Germany 2 Laboratory of Information Technologies, Joint Institute for Nuclear Research, Dubna, Russia
TRD Muon system
Track reconstruction algorithm • Two main steps: • Tracking • Global track selection • Tracking is based on • Track following • Initial seeds are tracks reconstructed in the STS (fast Cellular Automaton (CA), I.Kisel) • Kalman Filter • Validation gate • Hit-to-track association techniques • nearest neighbor: attaches the closest hit from the validation gate Global track selection • aim: remove clone and ghost tracks • tracks are sorted by their quality, obtained by chi-square and track length • Check for shared hits Track propagation • Inhomogeneous magnetic field: • solution of the equation of motion with the 4th order Runge-Kutta method • Large material budget: • Energy loss (ionization: Bethe-Bloch, bremsstrahlung: Bethe-Heitler, pair production) • Multiple scattering (Gaussian approximation)
Optimization of the algorithm • Minimize access to global memory • Approximation of the 70 MB large magnetic field map • 5 degree polynomial in the detector planes • parabola between the stations • Simplification of the detector geometry • Problem • Monte-Carlo geometry consists of 800000 nodes • Geometry navigation based on ROOT TGeo • Solution • Create simplified geometry by converting Monte-Carlo geometry • Implement fast geometry navigation for the simplified geometry • Computational optimization of the Kalman Filter • From double to float • Implicit calculation on non-trivial matrix elements • Loop unrolling • Branches (if then else ..) have been eliminated All these steps are necessary to implement SIMD tracking
Parallelism • Parallel programming is a mainstream! • SIMD – Single Instruction Multiple Data • KF track fitter: fully SIMDized • NN track finder: partially SIMDized • Multithreading • In event parallelization of the track finder • Event level parallelism
Performance of the track fit Track fit quality Speedup of the track fitter Throughput: 2*106 tracks/s Computer with 2xCPUs Intel Core i7 (8 cores in total) at 2.67 GHz
Performance of the parallel tracking • Simulation: • 1000 UrQMD events at 25 AGeV Au-Au collisions + 5 μ+ and 5 μ- embedded in each event Speedup of the track finder Computer with 2xCPUs Intel Core i7 (8 cores in total) at 2.67 GHz
Event level parallelism • Scheduler based on TBB tasks was used • 1000 AuAu central events at 25 AGeV per task • 1600 events per second can be reconstructed on lxir039 Computer lxir039 with 2xCPUs Intel Core i7 (8 cores in total) at 2.67 GHz Further steps: start investigations with PROOF.
Test of different MUCH layouts • Physical analysis of those MUCH layout variants are needed to evaluate their advantages and feasibility
TRD tracking efficiency 0.3 mm smearing in ”good” direction Smearing in ”bad” direction is different STS+TRD efficiency TRD efficiency all all reference reference position resolution [mum] position resolution [mum]
Summary • Tracking isfurtheroptimizedandtested on lxir039 computer • First tests on event level parallelization shows its scalability • TRD tracking was tested for different position resolution • Different MUCH layouts were tested, further physics analysis are needed