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.

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.
Game of Life Rules and Games Linh Tran ECE 573. What is Life? Life is just one example of a cellular automaton, which is any system in which rules are.
1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.
HLT - data compression vs event rejection. Assumptions Need for an online rudimentary event reconstruction for monitoring Detector readout rate (i.e.
ALICE TPC Online Tracking on GPU David Rohr for the ALICE Corporation Lisbon.
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
CHEP04 - Interlaken - Sep. 27th - Oct. 1st 2004T. M. Steinbeck for the Alice Collaboration1/20 New Experiences with the ALICE High Level Trigger Data Transport.
Programming SA --- Systolic Array SIMD --- Single Instruction Multiple Data ISA --- Instruction Systolic Array MIMD --- Multiple Instruction Multiple Data.
> IRTG – Heidelberg 2007 < Jochen Thäder – University of Heidelberg 1/18 ALICE HLT in the TPC Commissioning IRTG Seminar Heidelberg – January 2008 Jochen.
High Level Trigger of Muon Spectrometer Indranil Das Saha Institute of Nuclear Physics.
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,
CS305j Introduction to Computing Two Dimensional Arrays 1 Topic 22 Two Dimensional Arrays "Computer Science is a science of abstraction -creating the right.
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.
Variations of Conway’s Game of Life Eswar Kondapavuluri.
CA+KF Track Reconstruction in the STS I. Kisel GSI / KIP CBM Collaboration Meeting GSI, February 28, 2008.
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 Track Reconstruction in the CBM Experiment I. Kisel, I. Kulakov, I. Rostovtseva, M. Zyzak (for the CBM Collaboration) I. Kisel, I. Kulakov, I. Rostovtseva,
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 Viruses, Artificial Life & the Origin of Life Robert C Newman Abstracts of Powerpoint Talks - newmanlib.ibri.org -newmanlib.ibri.org.
The High-Level Trigger of the ALICE Experiment Heinz Tilsner Kirchhoff-Institut für Physik Universität Heidelberg International Europhysics Conference.
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.
Use of GPUs in ALICE (and elsewhere) Thorsten Kollegger TDOC-PG | CERN |
Real data reconstruction A. De Caro (University and INFN of Salerno) CERN Building 29, December 9th, 2009ALICE TOF General meeting.
Speed-up of the ring recognition algorithm Semeon Lebedev GSI, Darmstadt, Germany and LIT JINR, Dubna, Russia Gennady Ososkov LIT JINR, Dubna, Russia.
TPC online reconstruction Cluster Finder & Conformal Mapping Tracker Kalliopi Kanaki University of Bergen.
Tracking using Cellular Automaton Algorithm for CBM experiment Arkadiusz Bubak University of Silesia, Katowice, Poland.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Topic 26 Two Dimensional Arrays "Computer Science is a science of abstraction -creating the right model for a problem and devising the appropriate mechanizable.
Parallel Programming 0024 Spring Semester 2010 May 6, 2010.
The Game of Life Erik Amelia Amy. What is the “Game of Life?” The “Game of Life” (often referred to as Life) is not your typical game. There are no actual.
עקרונות תכנות מונחה עצמים תרגול 6 - GUI. סיכום ביניים GUI:  Swing  Basic components  Event handling  Containers  Layouts.
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.
Status of Reconstruction in CBM
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 Open charm simulations ( D +, D 0,  + c ) Sts geometry: 2MAPS +6strip (Strasbourg geo) or 2M2H4S (D+ and D - at 25AGeV); TOOLS: signal (D +  K - 
Normal text - click to edit HLT tracking in TPC Off-line week Gaute Øvrebekk.
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.
Status of global tracking and plans for Run2 (for TPC related tasks see Marian’s presentation) 1 R.Shahoyan, 19/03/14.
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.
HLT Kalman Filter Implementation of a Kalman Filter in the ALICE High Level Trigger. Thomas Vik, UiO.
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.
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.
FPGA Co-processor for the ALICE High Level Trigger Gaute Grastveit University of Bergen Norway H.Helstrup 1, J.Lien 1, V.Lindenstruth 2, C.Loizides 5,
Javier Castillo 1 Muon Embedding Status & Open Issues PWG3 - CERN - 15/02/2011.
CWG7 (reconstruction) R.Shahoyan, 12/06/ Case of single row Rolling Shutter  N rows of sensor read out sequentially, single row is read in time.
Some GPU activities at the CMS experiment Felice Pantaleo EP-CMG-CO EP-CMG-CO 1.
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,
1 Reconstruction tasks R.Shahoyan, 25/06/ Including TRD into track fit (JIRA PWGPP-1))  JIRA PWGPP-2: Code is in the release, need to switch setting.
AliRoot survey: Reconstruction P.Hristov 11/06/2013.
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 –
Track Reconstruction in MUCH and TRD Andrey Lebedev 1,2 Gennady Ososkov 2 1 Gesellschaft für Schwerionenforschung, Darmstadt, Germany 2 Laboratory of Information.
CALIBRATION: PREPARATION FOR RUN2 ALICE Offline Week, 25 June 2014 C. Zampolli.
Y. Fisyak1, I. Kisel2, I. Kulakov2, J. Lauret1, M. Zyzak2
Fast Parallel Event Reconstruction
Commissioning of the ALICE HLT, TPC and PHOS systems
ALICE HLT tracking running on GPU
TPC reconstruction in the HLT
A Fast Hardware Tracker for the ATLAS Trigger System
Presentation transcript:

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 ) ( for the ALICE Collaboration ) 1 Kirchhoff Institute for Physics, University of Heidelberg, Germany 2 Gesellschaft für Schwerionenforschung mbH, Darmstadt, Germany

CERNSergey Gorbunov, KIP2/12 Tracking with the Cellular Automaton method: principles The Cellular Automaton method for tracking, principles: Construction of global thing (track) using only local operations (hit-to-hit linking) Try to keep combinatorics at the local level Try to perform calculations in parallel Gradual complication of the calculations with complication of processed data “Game of life” - origin of the Cellular Automatons: A dead cell with exactly three live neighbors becomes a live cell (birth) A live cell with two or three live neighbors stays alive (survival) In all other cases, a cell dies or remains dead (overcrowding or loneliness) Evolution of all the cells proceeds in parallel, generation by generation birth survival death

CERNSergey Gorbunov, KIP3/12 Cellular Automaton - step 1: Creation of “cells” row 0 row 1 row 2 row 1 row 0 Creation of cells - “horizontal tracking”: local search for neighbors for each TPC cluster cluster-wise parallelism less combinatorics left for the further processing less data Clusters => Cells Group of TPC clusters Cell for the Cellular Automaton

CERNSergey Gorbunov, KIP4/12 Cellular Automaton - step 2: Merging cells One-to-one link [alive] Multiple link [dead] Multiple link [dead] Merging cells - evolution step: local search for neighbors in the next rows cell-wise parallelism cells are linked one-to-one, multi-neighbouring situations are left for the further analysis neighbouring criteria is flexible and can be different for physics, cosmics, calibration events.

CERNSergey Gorbunov, KIP5/12 Cellular Automaton - step 3: Creation of track segments Endpoint Track Cells => Endpoints Creation of the track segments: each sequence of the neighboring cells is composed to the track segment. track segment-wise parallelism no search, no combinatorics fitting mathematics only endpoints are left for the further reconstruction Endpoint object Track object Endpoint object Belongs to row, array sorted in Y Somewhere in memory

CERNSergey Gorbunov, KIP6/12 Cellular Automaton - step 4: Merging of segments Merging segment endpoints - evolution step: local search for the best neighbor in the closest rows endpoint-wise parallelism competition between links ( track length, closeness of the neighbour ) endpoints are linked one-to-one fitting mathematics (  2 check) Merge endpoints One way link [dead] One-to-one link [alive] Empty link [dead]

CERNSergey Gorbunov, KIP7/12 Cellular Automaton: example of event reconstruction Step 0: TPC clusters Step 1: Cells

CERNSergey Gorbunov, KIP8/12 Cellular Automaton: example of event reconstruction Step 2: Merging cells Step 3: Creation of track segments

CERNSergey Gorbunov, KIP9/12 Cellular Automaton: example of event reconstruction Step 4: Merging of segments Result: Reconstructed tracks

CERNSergey Gorbunov, KIP10/12 Cellular Automaton: performance Reference Set (All Set + P>1.) Time [ms]Ghost 29.6 Clone 94.7 Eff All Set (Hits >10, P >.05) 94.5 Eff Extra Set (All Set + P<1.) 30.6 Clone 97.9 Eff 5.9 Clone Construction of cells … 0.5 ms Merging of cells …… ms Creation of segments. 0.3 ms Fit of segments ……… 0.1 ms Merging of segments. 1.8 ms Reconstruction time for the whole TPC (36 slices) : Reconstruction performance: Soft track with 7 turns

CERNSergey Gorbunov, KIP11/12 Cellular Automaton: use of parallel hardware Hardware possibility for the parallel calculations: SIMD CPU instructions multi-threading multi-core CPU special hardware (Cell processor, Graphics cards ) CBM

CERNSergey Gorbunov, KIP12/12 Summary and plans Summary: The Cellular Automaton tracker for ALICE HLT has been developed The tracker shows good performance and speed It reconstructs all kinds of data: Physics, Cosmics, Calibration events; with and w/o magnetic field. Running on-line in HLT Current work: Speed up and tuning for Pb-Pb collisions Investigation of parallel hardware p-p event Pb-Pb event in work