CA+KF Track Reconstruction in the STS I. Kisel GSI / KIP CBM Collaboration Meeting GSI, February 28, 2008.

Slides:



Advertisements
Similar presentations
DEVELOPMENT OF ONLINE EVENT SELECTION IN CBM DEVELOPMENT OF ONLINE EVENT SELECTION IN CBM I. Kisel (for CBM Collaboration) I. Kisel (for CBM Collaboration)
Advertisements

GPU Programming using BU Shared Computing Cluster
Multi-core and tera- scale computing A short overview of benefits and challenges CSC 2007 Andrzej Nowak, CERN
L1 Event Reconstruction in the STS I. Kisel GSI / KIP CBM Collaboration Meeting Dubna, October 16, 2008.
CBM meeting, Dubna 2008/10/14 L1 CA Track Finder Status Ivan Kisel (KIP, Uni-Heidelberg), Irina Rostovtseva (ITEP Moscow) Study of L1 CA track finder with.
A many-core GPU architecture.. Price, performance, and evolution.
ALICE TPC Online Tracking on GPU David Rohr for the ALICE Corporation Lisbon.
ALICE HLT High Speed Tracking and Vertexing Real-Time 2010 Conference Lisboa, May 25, 2010 Sergey Gorbunov 1,2 1 Frankfurt Institute for Advanced Studies,
Porting Reconstruction Algorithms to the Cell Broadband Engine S. Gorbunov 1, U. Kebschull 1,I. Kisel 1,2, V. Lindenstruth 1, W.F.J. Müller 2 S. Gorbunov.
Computing Platform Benchmark By Boonyarit Changaival King Mongkut’s University of Technology Thonburi (KMUTT)
K-Ary Search on Modern Processors Fakultät Informatik, Institut Systemarchitektur, Professur Datenbanken Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner.
STS Simulations Anna Kotynia 15 th CBM Collaboration Meeting April , 2010, GSI 1.
KIP TRACKING IN MAGNETIC FIELD BASED ON THE CELLULAR AUTOMATON METHOD TRACKING IN MAGNETIC FIELD BASED ON THE CELLULAR AUTOMATON METHOD Ivan Kisel KIP,
Online Event Selection in the CBM Experiment I. Kisel GSI, Darmstadt, Germany RT'09, Beijing May 12, 2009.
Event Reconstruction in STS I. Kisel GSI CBM-RF-JINR Meeting Dubna, May 21, 2009.
Online Track Reconstruction in the CBM Experiment I. Kisel, I. Kulakov, I. Rostovtseva, M. Zyzak (for the CBM Collaboration) I. Kisel, I. Kulakov, I. Rostovtseva,
CA tracker for TPC online reconstruction CERN, April 10, 2008 S. Gorbunov 1 and I. Kisel 1,2 S. Gorbunov 1 and I. Kisel 1,2 ( for the ALICE Collaboration.
Many-Core Scalability of the Online Event Reconstruction in the CBM Experiment Ivan Kisel GSI, Germany (for the CBM Collaboration) CHEP-2010 Taipei, October.
Beam Dynamic Calculation by NVIDIA® CUDA Technology E. Perepelkin, V. Smirnov, and S. Vorozhtsov JINR, Dubna 7 July 2009.
Implementation of Parallel Processing Techniques on Graphical Processing Units Brad Baker, Wayne Haney, Dr. Charles Choi.
Helmholtz International Center for CBM – Online Reconstruction and Event Selection Open Charm Event Selection – Driving Force for FEE and DAQ Open charm:
Elastic Neural Net for standalone RICH ring finding Sergey Gorbunov Ivan Kisel DESY, Zeuthen KIP, Uni-Heidelberg DESY, Zeuthen KIP, Uni-Heidelberg KIP.
Status of the L1 STS Tracking I. Kisel GSI / KIP CBM Collaboration Meeting GSI, March 12, 2009.
Use of GPUs in ALICE (and elsewhere) Thorsten Kollegger TDOC-PG | CERN |
Speed-up of the ring recognition algorithm Semeon Lebedev GSI, Darmstadt, Germany and LIT JINR, Dubna, Russia Gennady Ososkov LIT JINR, Dubna, Russia.
VTU – IISc Workshop Compiler, Architecture and HPC Research in Heterogeneous Multi-Core Era R. Govindarajan CSA & SERC, IISc
Ooo Performance simulation studies of a realistic model of the CBM Silicon Tracking System Silicon Tracking for CBM Reconstructed URQMD event: central.
Fast reconstruction of tracks in the inner tracker of the CBM experiment Ivan Kisel (for the CBM Collaboration) Kirchhoff Institute of Physics University.
Fast track reconstruction in the muon system and transition radiation detector of the CBM experiment at FAIR Andrey Lebedev 1,2 Claudia Höhne 3 Ivan Kisel.
TRD and Global tracking Andrey Lebedev GSI, Darmstadt and LIT JINR, Dubna Gennady Ososkov LIT JINR, Dubna X CBM collaboration meeting Dresden, 27 September.
Impact parameter resolution study for ILC detector Tomoaki Fujikawa (Tohoku university) ACFA Workshop in Taipei Nov
Summary STS working group Design optimization STS (Strip) layout R&D (MAPS) Working packages.
Status of Reconstruction in CBM
Status of CBM muon studies I.Vassiliev, S.Gorbunov, I. Kisel and A.Kiseleva 16-Oct-06 Motivation Simulation tools cbmroot2 v06 Signal and background simulations.
KIP Ivan Kisel JINR-GSI meeting Nov 2003 High-Rate Level-1 Trigger Design Proposal for the CBM Experiment Ivan Kisel for Kirchhoff Institute of.
Standalone FLES Package for Event Reconstruction and Selection in CBM DPG Mainz, 21 March 2012 I. Kisel 1,2, I. Kulakov 1, M. Zyzak 1 (for the CBM.
Tracking in the CBM experiment I. Kisel Kirchhoff Institute of Physics, University of Heidelberg (for the CBM Collaboration) TIME05, Zurich, Switzerland.
Track Finding based on a Cellular Automaton Ivan Kisel Kirchhoff-Institut für Physik, Uni-Heidelberg Tracking Week, GSI January 24-25, 2005 KIP.
1)Leverage raw computational power of GPU  Magnitude performance gains possible.
1 Open charm simulations ( D +, D 0,  + c ) Sts geometry: 2MAPS +6strip (Strasbourg geo) or 2M2H4S (D+ and D - at 25AGeV); TOOLS: signal (D +  K - 
First Level Event Selection Package of the CBM Experiment S. Gorbunov, I. Kisel, I. Kulakov, I. Rostovtseva, I. Vassiliev (for the CBM Collaboration (for.
Performance simulations with a realistic model of the CBM Silicon Tracking System Silicon tracking for CBM Number of integration components Ladders106.
Methods for fast reconstruction of events Ivan Kisel Kirchhoff-Institut für Physik, Uni-Heidelberg FutureDAQ Workshop, München March 25-26, 2004 KIP.
Fast Tracking of Strip and MAPS Detectors Joachim Gläß Computer Engineering, University of Mannheim Target application is trigger  1. do it fast  2.
STS Radiation Environment 11 th CBM Collaboration Meeting GSI, February 2008 Radoslaw Karabowicz GSI.
Track reconstruction in TRD and MUCH Andrey Lebedev Andrey Lebedev GSI, Darmstadt and LIT JINR, Dubna Gennady Ososkov Gennady Ososkov LIT JINR, Dubna.
Global Tracking for CBM Andrey Lebedev 1,2 Ivan Kisel 1 Gennady Ososkov 2 1 GSI Helmholtzzentrum für Schwerionenforschung GmbH, Darmstadt, Germany 2 Laboratory.
Cellular Automaton Method for Track Finding (HERA-B, LHCb, CBM) Ivan Kisel Kirchhoff-Institut für Physik, Uni-Heidelberg Second FutureDAQ Workshop, GSI.
Muon detection in the CBM experiment at FAIR Andrey Lebedev 1,2 Claudia Höhne 1 Ivan Kisel 1 Anna Kiseleva 3 Gennady Ososkov 2 1 GSI Helmholtzzentrum für.
Reconstruction Chain used for the D Meson Analysis Ivan Kisel Kirchhoff Institute of Physics University of Heidelberg, Germany CBM Collaboration Meeting.
CA+KF Track Reconstruction in the STS S. Gorbunov and I. Kisel GSI/KIP/LIT CBM Collaboration Meeting Dresden, September 26, 2007.
A parallel High Level Trigger benchmark (using multithreading and/or SSE)‏ Håvard Bjerke.
Kalman Filter based Track Fit running on Cell S. Gorbunov 1,2, U. Kebschull 2, I. Kisel 2,3, V. Lindenstruth 2 and W.F.J. Müller 1 1 Gesellschaft für Schwerionenforschung.
1/13 Future computing for particle physics, June 2011, Edinburgh A GPU-based Kalman filter for ATLAS Level 2 Trigger Dmitry Emeliyanov Particle Physics.
Parallelization of the SIMD Kalman Filter for Track Fitting R. Gabriel Esteves Ashok Thirumurthi Xin Zhou Michael D. McCool Anwar Ghuloum Rama Malladi.
Fast parallel tracking algorithm for the muon detector of the CBM experiment at FAIR Andrey Lebedev 1,2 Claudia Höhne 1 Ivan Kisel 1 Gennady Ososkov 2.
KIP Ivan Kisel, Uni-Heidelberg, RT May 2003 A Scalable 1 MHz Trigger Farm Prototype with Event-Coherent DMA Input V. Lindenstruth, D. Atanasov,
Object-Oriented Track Reconstruction in the PHENIX Detector at RHIC Outline The PHENIX Detector Tracking in PHENIX Overview Algorithms Object-Oriented.
Parallel Implementation of the KFParticle Vertexing Package for the CBM and ALICE Experiments Ivan Kisel 1,2,3, Igor Kulakov 1,4, Maksym Zyzak 1,4 1 –
LIT participation LIT participation Ivanov V.V. Laboratory of Information Technologies Meeting on proposal of the setup preparation for external beams.
Track Reconstruction in MUCH and TRD Andrey Lebedev 1,2 Gennady Ososkov 2 1 Gesellschaft für Schwerionenforschung, Darmstadt, Germany 2 Laboratory of Information.
Sobolev(+Node 6, 7) Showcase +K20m GPU Accelerator.
Y. Fisyak1, I. Kisel2, I. Kulakov2, J. Lauret1, M. Zyzak2
Kalman filter tracking library
Geant4 MT Performance Soon Yung Jun (Fermilab)
Fast Parallel Event Reconstruction
ALICE HLT tracking running on GPU
TPC reconstruction in the HLT
ALICE Computing Upgrade Predrag Buncic
The LHCb Level 1 trigger LHC Symposium, October 27, 2001
Presentation transcript:

CA+KF Track Reconstruction in the STS I. Kisel GSI / KIP CBM Collaboration Meeting GSI, February 28, 2008

28 February 2008, GSIIvan Kisel, GSI2/14 Track Finder: what is the next Step? Optimize the STS geometry (strips, sector navigation) Optimize the STS geometry (strips, sector navigation) Mathematical and computational optimization Mathematical and computational optimization SIMDization of the algorithm (from scalars to vectors) SIMDization of the algorithm (from scalars to vectors) MIMDization (multi-threads, multi-cores) MIMDization (multi-threads, multi-cores) High track density High track density Non-homogeneous magnetic field Non-homogeneous magnetic field Fake space points are dominated Fake space points are dominated Single-sided strip detectors Single-sided strip detectors Detector inefficiency Detector inefficiency Not perfectly aligned system Not perfectly aligned system On-line event selection On-line event selection Large PC farm Large PC farm

28 February 2008, GSIIvan Kisel, GSI3/14 Data Acquisition System EventBuilderNetwork 100 ev/slice Detector PC Farm 10 7 ev/s 10 5 sl/s 50 kB/ev 5 MB/slice N x M SchedulerScheduler Sub-Farm RU RU RU RU RU RU RU RU RU RU RU RU RU RU RU RU Farm Control System Sub-Farm SF n available SF n tt MAPSSTSRICHTRDECAL SF n tt MAPSSTSRICHTRDECAL SF n tt tt tt tt 10 ? PCs

28 February 2008, GSIIvan Kisel, GSI4/14 Cell Blade – a Sub-Farm with (2+16) Cores Tracking and Vertexing Units Sub-Farm Management Unit Sub-Farm Decision/Selection Unit FPGA PCPCPCPCPCSub-Farm

28 February 2008, GSIIvan Kisel, GSI5/14 Welcome to the Era of Multicore HPC Gaming STI: Cell STI: CellGaming GP GPU Nvidia: Tesla Nvidia: Tesla GP GPU Nvidia: Tesla Nvidia: Tesla GP CPU Intel: Larrabee Intel: Larrabee GP CPU Intel: Larrabee Intel: Larrabee CPU/GPU AMD: Fusion AMD: FusionCPU/GPU ?? High performance computing (HPC) High performance computing (HPC) Highest clock rate is reached Highest clock rate is reached Performance/power optimization Performance/power optimization Heterogeneous systems of many (>8) cores Heterogeneous systems of many (>8) cores Similar programming languages (Ct and CUDA), but standards are unlikely Similar programming languages (Ct and CUDA), but standards are unlikely We need a uniform approach to all CPU/GPU families We need a uniform approach to all CPU/GPU families How to take advantage of the additional cores? How to take advantage of the additional cores?

28 February 2008, GSIIvan Kisel, GSI6/14 NVIDIA GeForce 9600 GT GPU: 64 Cores 64 processors 64 processors GHz frequency GHz frequency double precision (?) double precision (?) 170 EUR price 170 EUR price

28 February 2008, GSIIvan Kisel, GSI7/14 Intel Polaris: 80 Cores 3.16 GHz, 0.95 Volt, 62 Watt -> 1.01 Teraflops 3.16 GHz, 0.95 Volt, 62 Watt -> 1.01 Teraflops

28 February 2008, GSIIvan Kisel, GSI8/14 Cell Processor: 1+8 Cores

28 February 2008, GSIIvan Kisel, GSI9/14 Computer Physics Communications 178 (2008)

28 February 2008, GSIIvan Kisel, GSI10/14 Speed-up of the Kalman Filter Track Fit

28 February 2008, GSIIvan Kisel, GSI11/14 Structure and Data: a Bottleneck cbmroot/L1 L1Algo L1Geometry L1Event (L1Strips, L1Hits) L1Tracks Strips: float vStripValues[NStrips]; // strip coordinates (32b) unsigned char vStripFlags [NStrips]; // strip iStation (6b) + used (1b) + used_by_dublets (1b)Hits: struct L1StsHit { unsigned short int f, b; // front (16b) and back (16b) strip indices }; L1StsHit L1StsHit vHits[NHits]; unsigned short int vRecoHits [NRecoHits]; // hit index (16b) unsigned char vRecoTracks [NRecoTracks]; // N hits on track (8b) class L1Triplet{ unsigned short int w0; // left hit (16b) unsigned short int w1; // first neighbour (16b) or middle hit (16b) unsigned short int w2; // N neighbours (16b) or right hit (16b) unsigned char b0; // chi2 (5b) + level (3b) unsigned char b1; // qp (8b) unsigned char b2; // qp error (8b) } Input: Output: Internal: L1Algo A standalone L1Algo module 300 kB About 300 kB per central event

28 February 2008, GSIIvan Kisel, GSI12/14 Parallelization of the CA Track Finder 1 Create tracklets 2 Collect tracks GSI, KIP, CERN

28 February 2008, GSIIvan Kisel, GSI13/14 Kalman Filter Track Fit on Multicore Systems: Multithreading Real fit time/track (us)‏ #tasks Logarithmic scale! Håvard Bjerke

28 February 2008, GSIIvan Kisel, GSI14/14 Summary and Plans SIMDized CA track finder works well SIMDized CA track finder works well Work on single-sided strip detectors started Work on single-sided strip detectors started Multithreaded Kalman filter track fit Multithreaded Kalman filter track fit  Learn Ct (Intel) and CUDA (Nvidia) programming languages  Investigate large multi-core systems (CPU and GPU)  Parallelize the CA track finder  Parallel hardware -> parallel languages -> parallel algorithms

28 February 2008, GSIIvan Kisel, GSI15/14 Double-Sided vs. Single-Sided Strip Detectors: Tracking Efficiency D-S: Efficiency, % Track category S-S: Efficiency, % 96.0Reference set (>1 GeV/c) All set (>=4 hits, >100 MeV/c) Extra set (<1 GeV/c) Clone Ghost MC tracks/event found Time/event, s25.6 Standard geometry with all strips Standard geometry with all strips Thickness is the same for D-S and S-S strip stations Thickness is the same for D-S and S-S strip stations Front stations positioned as in sts_allstrips.geo, back stations shifted in Z st +1cm Front stations positioned as in sts_allstrips.geo, back stations shifted in Z st +1cm Fake space points are produced as in the double-sided scenario (within the same sector) Fake space points are produced as in the double-sided scenario (within the same sector) True space points taken from MC (different sectors possible) True space points taken from MC (different sectors possible) No SIMDization No SIMDization No sorting of strips No sorting of strips No sector navigation No sector navigation No memory optimization No memory optimization