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.

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

L1 Event Reconstruction in the STS I. Kisel GSI / KIP CBM Collaboration Meeting Dubna, October 16, 2008.
Kalman’s Beautiful Filter (an introduction) George Kantor presented to Sensor Based Planning Lab Carnegie Mellon University December 8, 2000.
Sam Pfister, Stergios Roumeliotis, Joel Burdick
1 Vertex fitting Zeus student seminar May 9, 2003 Erik Maddox NIKHEF/UvA.
1 Integration of Background Modeling and Object Tracking Yu-Ting Chen, Chu-Song Chen, Yi-Ping Hung IEEE ICME, 2006.
Kalman Filtering Jur van den Berg. Kalman Filtering (Optimal) estimation of the (hidden) state of a linear dynamic process of which we obtain noisy (partial)
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,
Course AE4-T40 Lecture 5: Control Apllication
Computer Vision Linear Tracking Jan-Michael Frahm COMP 256 Some slides from Welch & Bishop.
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.
K-Ary Search on Modern Processors Fakultät Informatik, Institut Systemarchitektur, Professur Datenbanken Benjamin Schlegel, Rainer Gemulla, Wolfgang Lehner.
1 Formation et Analyse d’Images Session 7 Daniela Hall 7 November 2005.
Muhammad Moeen YaqoobPage 1 Moment-Matching Trackers for Difficult Targets Muhammad Moeen Yaqoob Supervisor: Professor Richard Vinter.
CA+KF Track Reconstruction in the STS I. Kisel GSI / KIP CBM Collaboration Meeting GSI, February 28, 2008.
1 Miodrag Bolic ARCHITECTURES FOR EFFICIENT IMPLEMENTATION OF PARTICLE FILTERS Department of Electrical and Computer Engineering Stony Brook University.
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.
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.
Computer vision: models, learning and inference Chapter 19 Temporal models.
Helmholtz International Center for CBM – Online Reconstruction and Event Selection Open Charm Event Selection – Driving Force for FEE and DAQ Open charm:
Status of the L1 STS Tracking I. Kisel GSI / KIP CBM Collaboration Meeting GSI, March 12, 2009.
Tracking at LHCb Introduction: Tracking Performance at LHCb Kalman Filter Technique Speed Optimization Status & Plans.
© 2007 SET Associates Corporation SAR Processing Performance on Cell Processor and Xeon Mark Backues, SET Corporation Uttam Majumder, AFRL/RYAS.
Speed-up of the ring recognition algorithm Semeon Lebedev GSI, Darmstadt, Germany and LIT JINR, Dubna, Russia Gennady Ososkov LIT JINR, Dubna, Russia.
STS track recognition by 3D track-following method Gennady Ososkov, A.Airiyan, A.Lebedev, S.Lebedev, E.Litvinenko Laboratory of Information Technologies.
Human-Computer Interaction Kalman Filter Hanyang University Jong-Il Park.
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.
Status of Reconstruction in CBM
Sep 08, 2009 SPEEDUP – Optimization and Porting of Path Integral MC Code to New Computing Architectures V. Slavnić, A. Balaž, D. Stojiljković, A. Belić,
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.
NCAF Manchester July 2000 Graham Hesketh Information Engineering Group Rolls-Royce Strategic Research Centre.
Principles of Radar Target Tracking The Kalman Filter: Mathematical Radar Analysis.
V0 analytical selection Marian Ivanov, Alexander Kalweit.
First Level Event Selection Package of the CBM Experiment S. Gorbunov, I. Kisel, I. Kulakov, I. Rostovtseva, I. Vassiliev (for the CBM Collaboration (for.
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.
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.
Kalman Filtering And Smoothing
Monday, January 24 TimeTitleSpeaker 10:00 – 10:30The CBM experimentV. Friese (GSI) 10:30 – 11:00CBM Silicon Pixel Vertex DetectorM. Deveaux (GSI/IReS)
Tracking with dynamics
Nonlinear State Estimation
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.
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,
IBM Cell Processor Ryan Carlson, Yannick Lanner-Cusin, & Cyrus Stoller CS87: Parallel and Distributed Computing.
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.
Y. Fisyak1, I. Kisel2, I. Kulakov2, J. Lauret1, M. Zyzak2
Kalman filter tracking library
M. Kuhn, P. Hopchev, M. Ferro-Luzzi
Fast Parallel Event Reconstruction
ALICE HLT tracking running on GPU
TPC reconstruction in the HLT
Kalman’s Beautiful Filter (an introduction)
Kalman Filter فيلتر كالمن در سال 1960 توسط R.E.Kalman در مقاله اي تحت عنوان زير معرفي شد. “A new approach to liner filtering & prediction problem” Transactions.
Multicore and GPU Programming
Presentation transcript:

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 mbH, Darmstadt, Germany 2 Kirchhoff Institute for Physics, University of Heidelberg, Germany 3 Laboratory of Information Technologies, JINR, Dubna, Russia IBM, Böblingen February 13, 2007

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg2/20Terminology Kalman Filter based Track Fit running on Cell

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg3/20 The Kalman Filter 1/3 The Kalman filter is a recursive algorithm which estimates the state of a dynamic system from a series of incomplete and noisy measurements. The Kalman filter is a recursive algorithm which estimates the state of a dynamic system from a series of incomplete and noisy measurements. The filter was developed in papers by Swerling (1958), Kalman (1960), and Kalman and Bucy (1961). The filter is named after Rudolf E. Kalman. An example of an application would be to provide accurate continuously-updated information about the position and velocity of an object given only a sequence of observations about its position, each of which includes some error. It is used in a wide range of engineering applications from radar to computer vision. simpleextendedinformationsquare-root A wide variety of Kalman filters have now been developed, from Kalman's original formulation, now called the simple Kalman filter, to extended filter, the information filter and a variety of square-root filters.

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg4/20 Example: Radar Applications 2/3 In a radar application, where one is interested in following a target, information about the location, speed, and acceleration of the target is measured at different moments in time with corruption by noise. r = { x, y, z, v x, v y, v z }  2 x  2 y …  2 y …  2 z  2 z  2 vx  2 vx …  2 vy …  2 vy  2 vz  2 vz C = December 21, The Apollo 8 spacecraft has just been sent on its way to the Moon. 003:46:31 Collins: Roger. At your convenience, would you please go P00 and Accept? We're going to update to your W-matrix. State vector Covariance matrix position velocity error of x

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg5/20 The Kalman Filter Algorithm 3/3 The Kalman filter exploits the dynamics of the target, which govern its time evolution, to remove the effects of the noise and get a good estimate of the location of the target filtering at the present time (filtering), prediction at a future time (prediction), or interpolationsmoothing at a time in the past (interpolation or smoothing). recursive The Kalman filter is a recursive estimator – only the estimated state from the previous time step and the current measurement are needed to compute the estimate for the current state.n n+1 n mean value over n measurements n+1 mean value over n+1 measurements previous estimation new measurement correction weight PredictionorExtrapolation UpdateorFilter

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg6/20Terminology Kalman Filter based Track Fit running on Cell

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg7/20 The Compressed Baryonic Matter Experiment (GSI, Darmstadt) 1/3 CBM is a typical modern high energy physics experiment CBM is a typical modern high energy physics experiment Challenge: ~ 1000 charged particles/collision 10 7 Au+Au collisions/sec high speed data acquisition and trigger system Track == trajectory

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg8/20 Data Acquisition System 2/3 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 … Cell, Cell, Cell, Cell … ~1000 PCs

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg9/20 Stages of Data Reconstruction 3/3 Track finding Track fitting Vertex finding/fitting Ring finding (PID) Time consuming!! ! Kalman Filter Combinatorics Conformal Mapping Conformal Mapping Hough Transformation Hough Transformation Track Following + Kalman Filter Track Following + Kalman Filter Cellular Automaton + Kalman Filter Cellular Automaton + Kalman Filter

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg10/20Terminology Kalman Filter based Track Fit running on Cell

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg11/20 Kalman Filter for Track Fit 1/3 detectors measurements e-e-e-e- (r, C) track parameters and errors

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg12/20 The Kalman Filter for Track Fit 2/3 arbitrary large errors non-homogeneous magnetic field as large map multiple scattering in material small errors weight for update >>> 256 KB of Local Store not enough accuracy in single precision

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg13/20 Modifications of the Fitting Algorithm 3/3 The initial track parameters are directly estimated from the input data. The propagation step is performed directly from measurement to measurement without intermediate steps. Matrix multiplications have been replaced by direct operations on only non-trivial matrix elements. Most loops have been unrolled in order to provide additional instructions for interleaving. All branches have been eliminated from the algorithm to avoid branch misprediction penalty. Calculations have been reordered for better use of the processors pipeline.

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg14/20Terminology Kalman Filter based Track Fit running on Cell

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg15/20 Cell Processor: Supercomputer-on-a-Chip 1/5 Approach: Run SPEs independently (one collision per SPE)Run SPEs independently (one collision per SPE) Vectorization (SIMDization)Vectorization (SIMDization) Universality (any CPU architecture)Universality (any CPU architecture)

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg16/20 Porting the Kalman Filter on Cell 2/5 1.GSI-Linux 2.Virtual machine: Red Hat (Fedora Core 4) Red Hat (Fedora Core 4) Cell Simulator: Cell Simulator:  PPE  SPE 3.Cell Blade SSE2 SSE2 AltiVec Specialized SIMD Data Types: Platform: Use headers to overload +, -, *, / operators --> the source code is unchanged ! c = a + b Scalar double Scalar double Scalar float Scalar float Pseudo-vector (array) Pseudo-vector (array) Vector (4 float) Vector (4 float)

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg17/20 SPE Statistics 3/5

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg18/20 Modifications of the Fitting Algorithm 4/5 Intel P4 Cell

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg19/20 Kalman Filter on Intel Xeon, AMD Opteron and Cell 5/5 Fit of a single track: Fit of thousands of tracks: lxg1411 eh102 blade11bc Cell SPE is: 1.5 times faster than Intel Xeon and 2 times faster than AMD Opteron and 2 times faster than AMD Opteron Cell SPE is: 1.5 times faster than Intel Xeon and 2 times faster than AMD Opteron and 2 times faster than AMD Opteron

13 February 2007, IBM BöblingenIvan Kisel, KIP, Uni-Heidelberg20/20 Summary and Plans Sub-Farm … Cell, Cell, Cell, Cell … On-line Selection (Trigger) DevelopmentDevelopment 1. Distribution of Data 2. Track Finding 3. Track Fit Kalman Filter Intel, AMD and Cell ? Cellular Automaton ? Sub-Farm Demonstrator