Methods for fast reconstruction of events Ivan Kisel Kirchhoff-Institut für Physik, Uni-Heidelberg FutureDAQ Workshop, München March 25-26, 2004 KIP.

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

BTeV Trigger BEAUTY th International Conference on B-Physics at Hadron Machines Oct , 2003, Carnegie Mellon University Michael Wang, Fermilab.
High Level Trigger (HLT) for ALICE Bergen Frankfurt Heidelberg Oslo.
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.
Computing EVO meeting, January 15 th 2013 Status of the Tracking Code Gianluigi Boca, Pavia University.
Pattern Recognition in OPERA Tracking A.Chukanov, S.Dmitrievsky, Yu.Gornushkin OPERA collaboration meeting, Ankara, Turkey, 1-4 of April 2009 JINR, Dubna.
7 Nov 2002Niels Tuning - Vertex A vertex trigger for LHCb The trigger for LHCb ….. and the use of the Si vertex detector at the first and second.
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.
High Level Trigger – Applications Open Charm physics Quarkonium spectroscopy Dielectrons Dimuons Jets.
A Fast Level 2 Tracking Algorithm for the ATLAS Detector Mark Sutton University College London 7 th October 2005.
27 th June 2008Johannes Albrecht, BEACH 2008 Johannes Albrecht Physikalisches Institut Universität Heidelberg on behalf of the LHCb Collaboration The LHCb.
VELO Beamtest Trigger VELO meeting 08/12/2005 Jianchun (JC) Wang Syracuse University.
HLT Collaboration (28-Jun-15) 1 High Level Trigger L0 L1 L2 HLT Dieter Roehrich UiB Trigger Accept/reject events Select Select regions of interest within.
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,
BTeV Trigger Architecture Vertex 2002, Nov. 4-8 Michael Wang, Fermilab (for the BTeV collaboration)
Without hash sorting, all O(n 2 ) combinations must be checked. Hash Sorter - Firmware Implementation and an Application for the Fermilab BTeV Level 1.
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,
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.
The High-Level Trigger of the ALICE Experiment Heinz Tilsner Kirchhoff-Institut für Physik Universität Heidelberg International Europhysics Conference.
1 Tracking Reconstruction Norman A. Graf SLAC July 19, 2006.
Elastic Neural Net for standalone RICH ring finding Sergey Gorbunov Ivan Kisel DESY, Zeuthen KIP, Uni-Heidelberg DESY, Zeuthen KIP, Uni-Heidelberg KIP.
Tracking at LHCb Introduction: Tracking Performance at LHCb Kalman Filter Technique Speed Optimization Status & Plans.
Faster tracking in hadron collider experiments  The problem  The solution  Conclusions Hans Drevermann (CERN) Nikos Konstantinidis ( Santa Cruz)
David N. Brown Lawrence Berkeley National Lab Representing the BaBar Collaboration The BaBar Mini  BaBar  BaBar’s Data Formats  Design of the Mini 
Speed-up of the ring recognition algorithm Semeon Lebedev GSI, Darmstadt, Germany and LIT JINR, Dubna, Russia Gennady Ososkov LIT JINR, Dubna, Russia.
Tracking using Cellular Automaton Algorithm for CBM experiment Arkadiusz Bubak University of Silesia, Katowice, Poland.
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.
CBM Software Workshop for Future Challenges in Tracking and Trigger Concepts, GSI, 9 June 2010 Volker Friese.
A Pattern Recognition Scheme for Large Curvature Circular Tracks and Its FPGA Implementation Example Using Hash Sorter Jinyuan Wu and Z. Shi Fermi National.
Status of Reconstruction in CBM
Simulations for CBM CBM-India Meeting, Jammu, 12 February 2008 V. Friese
Pattern Recognition in OPERA Tracking A.Chukanov, S.Dmitrievsky, Yu.Gornushkin OPERA collaboration meeting, Mizunami, Japan, of January 2009 JINR,
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.
STAR TPC Cluster and Hit Finder Software Raimond Snellings.
Performance simulations with a realistic model of the CBM Silicon Tracking System Silicon tracking for CBM Number of integration components Ladders106.
Fast Tracking of Strip and MAPS Detectors Joachim Gläß Computer Engineering, University of Mannheim Target application is trigger  1. do it fast  2.
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.
Monday, January 24 TimeTitleSpeaker 10:00 – 10:30The CBM experimentV. Friese (GSI) 10:30 – 11:00CBM Silicon Pixel Vertex DetectorM. Deveaux (GSI/IReS)
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.
KIP Ivan Kisel, Uni-Heidelberg, RT May 2003 A Scalable 1 MHz Trigger Farm Prototype with Event-Coherent DMA Input V. Lindenstruth, D. Atanasov,
LHCb future upgrades, Electronics R&D, Vertex trigger, J. Christiansen LHCb electronics coordination.
July 22, 2002Brainstorming Meeting, F.Teubert L1/L2 Trigger Algorithms L1-DAQ Trigger Farms, July 22, 2002 F.Teubert on behalf of the Trigger Software.
LHCb trigger: algorithms and performance Hugo Ruiz Institut de Ciències del Cosmos March 12 th -17 th 2009, Tsukuba, Japan On behalf of the LHCb Collaboration.
3 May 2003, LHC2003 Symposium, FermiLab Tracking Performance in LHCb, Jeroen van Tilburg 1 Tracking performance in LHCb Tracking Performance Jeroen van.
BESIII offline software group Status of BESIII Event Reconstruction System.
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
Fast Parallel Event Reconstruction
ALICE HLT tracking running on GPU
TPC reconstruction in the HLT
The LHC collider in Geneva
The Level-0 Calorimeter Trigger and the software triggers
The LHCb VELO and its use in the trigger
The LHCb Level 1 trigger LHC Symposium, October 27, 2001
The LHCb VErtex LOcator
Presentation transcript:

Methods for fast reconstruction of events Ivan Kisel Kirchhoff-Institut für Physik, Uni-Heidelberg FutureDAQ Workshop, München March 25-26, 2004 KIP

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg2 CBM Trigger

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg3Algorithms Simple Local Parallel Fast HT - Hough Transform CA - Cellular Automaton EN - Elastic Net KF - Kalman Filter

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg4 CA – Game “Life” Each cell has 8 neighboring cells, 4 adjacent orthogonally, 4 adjacent diagonally. The rules are: Survivals. Every counter with 2 or 3 neighboring counters survives for the next generation. Deaths. Each counter with 4 or more neighbors dies from overpopulation. Every counter with 1 neighbor or none dies from isolation. Births. Each empty cell adjacent to exactly 3 neighbors is a birth cell. It is important to understand that all births and deaths occur simultaneously. Each cell has 8 neighboring cells, 4 adjacent orthogonally, 4 adjacent diagonally. The rules are: Survivals. Every counter with 2 or 3 neighboring counters survives for the next generation. Deaths. Each counter with 4 or more neighbors dies from overpopulation. Every counter with 1 neighbor or none dies from isolation. Births. Each empty cell adjacent to exactly 3 neighbors is a birth cell. It is important to understand that all births and deaths occur simultaneously. Sci. Amer., 223 (1970) 120 TRACKING ! NOISE ! TRACK ! no convergence ! RECO TRACK RECO TRACK RECO TRACK RECO TRACK RECO TRACK RECO TRACK GHOST TRACK ? GHOST TRACK ? moves moves

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg5 CA – Segment Tracking NIM A387 (1997) 433; NIM A489 (2002) 389; NIM A490 (2002) 546

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg6 BTeV L1 Vertex Trigger segment trackers (~500 FPGAs) Merge Trigger decision to Global Level 1 Switch: sort by crossing number track/vertex farm (~2500 DSPs) 30 station pixel detector Find beginning and ending segments of tracks from hit clusters in 3 adjacent stations (triplets):   beginning segments: required to originate from beam region   ending segments: required to project out of pixel detector volume FPGA Segment Finder (Pattern Recognition) Match beginning and ending segments found by FPGA segment finder to form complete tracks Reconstruct primary interaction vertices using complete tracks Find tracks that are “detached” from reconstructed primaries DSP Tracking and Vertexing >50% of total L1 processing time is taken up by the segment matching However Triplet FPGA Beauty-2002; BTeV Coll. Meeting, March 2003

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg7 LHCb L1 Vertex Trigger Z vtx histogram X,Y vtx 2d tracks in a 45 o sector: Triplet  time (ms)  Events 17 ms CPU (CA) 5 ms 15  s 130  s  Events  time (  s) FPGA (CA) LHCb Trigger TDR, CERN-LHCC ; LHCb Note Find VELO 2D tracks (~70) and reconstruct 3D primary vertex Reconstruct high-impact parameter tracks (~10%) in 3D Extrapolate to TT through small magnetic field -> PT Match tracks to L0 muon objects -> PT and PID Select B-events using impact parameter and PT information Use T1-3 data to improve further selection (5-10% of events)

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg8 CBM Trigger Algorithm M1 M2 S1 S2 S3 S4 S5 D J/  RICH TRD, ECAL

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg9 EN – Traveling Salesman Problem Continuous EN Discrete EN File Cities Extra path Time, sec(*) (*) Pentium II/100 MHz Nature, 326 (1987) 689; J. Comp. Meth. Sci. Eng., 2 (2002) 111

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg10 EN – Ring Search CHEP’01, Beijing (2001) 162

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg11 Kalman Filter –> Kalman Smoother Kalman Filter One Processing Unit Consecutively hit by hit Kalman Smoother Many Processing Units All hits in parallel NIM A489 (2002) 389; NIM A490 (2002) 546

25-26 March 2004, MünchenIvan Kisel, KIP, Uni-Heidelberg12ConclusionSimpleLocalParallelFast Hough Transform Cellular Automaton Elastic Net Kalman Filter