Bonn 2010 – scientific programme
Parts | Days | Selection | Search | Downloads | Help
HK: Fachverband Physik der Hadronen und Kerne
HK 36: Postersitzung
HK 36.6: Poster
Wednesday, March 17, 2010, 14:00–16:00, HG Aula
A parallel algorithm for reconstruction of short-lived particles — Ivan Kisel1 and •Maksym Zyzak2,3 — 1GSI Helmholtzzentrum für Schwerionenforschung GmbH — 2Goethe-Universität Frankfurt am Main — 3National Taras Shevchenko University of Kyiv, Ukraine
The CBM experiment at FAIR/GSI is being designed as a heavy-ion experiment with an extremely high interaction rate. For event selection purposes the full event reconstruction is required. That is why the speed of the reconstruction algorithms is very crucial. Parallel programming is considered now as one of the most effective ways to increase the speed of the event reconstruction.
Reconstruction of short-lived particles is used in data analysis of many high energy physics experiments. In the current work, the Kalman filter based algorithm for short-lived particles reconstruction has been parallelized. For more effective use of parallel instructions the approximation of the magnetic field is required. The approximation errors less than 3.5% have been achieved, while on average the errors are less than 0.3%. With implementation of SIMD instructions and magnetic field approximation the time for the primary vertex reconstruction in proton-carbon collisions is 45 µs, and 20 µs for Λ reconstruction on Intel Pentium Dual at 2.0 GHz.