G. Volpi - INFN Frascati ANIMMA 2011. Search for rare SM or predicted BSM processes push the colliders intensity to new frontiers Rare processes are overwhelmed.

Slides:



Advertisements
Similar presentations
Freiburg Seminar, Sept Sascha Caron Finding the Higgs or something else ideas to improve the discovery ideas to improve the discovery potential at.
Advertisements

Track Trigger Designs for Phase II Ulrich Heintz (Brown University) for U.H., M. Narain (Brown U) M. Johnson, R. Lipton (Fermilab) E. Hazen, S.X. Wu, (Boston.
Terzo Convegno sulla Fisica di ALICE - LNF, Andrea Dainese 1 Preparation for ITS alignment A. Dainese (INFN – LNL) for the ITS alignment group.
FTKSim Status: Ghost Busting part. II The Hit Warrior F. Crescioli, M. Dell'Orso, P. Gianetti G. Punzi, G. Volpi FTK Meeting 10/19/2006.
Digital Filtering Performance in the ATLAS Level-1 Calorimeter Trigger David Hadley on behalf of the ATLAS Collaboration.
June 6 th, 2011 N. Cartiglia 1 “Measurement of the pp inelastic cross section using pile-up events with the CMS detector” How to use pile-up.
A Fast Level 2 Tracking Algorithm for the ATLAS Detector Mark Sutton University College London 7 th October 2005.
The Silicon Track Trigger (STT) at DØ Beauty 2005 in Assisi, June 2005 Sascha Caron for the DØ collaboration Tag beauty fast …
The First-Level Trigger of ATLAS Johannes Haller (CERN) on behalf of the ATLAS First-Level Trigger Groups International Europhysics Conference on High.
1 introduction FTK, which stands for Fast Tracker, is an upgrade for ATLAS detector aims to provide tracking information for level 2 trigger of ATLAS detector.
Track quality - impact on hardware of different strategies Paola FTK meeting Performances on WH and Bs   2.Now we use all the layers.
The new Silicon detector at RunIIb Tevatron II: the world’s highest energy collider What’s new?  Data will be collected from 5 to 15 fb -1 at  s=1.96.
Striplet option of Super Belle Silicon Vertex Detector Talk at Joint Super B factory workshop, Honolulu 20 April 2005 T.Tsuboyama.
The ATLAS trigger Ricardo Gonçalo Royal Holloway University of London.
Online Measurement of LHC Beam Parameters with the ATLAS High Level Trigger David W. Miller on behalf of the ATLAS Collaboration 27 May th Real-Time.
1 Cluster Quality in Track Fitting for the ATLAS CSC Detector David Primor 1, Nir Amram 1, Erez Etzion 1, Giora Mikenberg 2, Hagit Messer 1 1. Tel Aviv.
BTeV Trigger Architecture Vertex 2002, Nov. 4-8 Michael Wang, Fermilab (for the BTeV collaboration)
Status of FTK simulation June 16,2005 G. Punzi, Pisa.
Simulation Tasks  Understanding Tracking  Understanding Hardware 1.Two types of tasks: a.Implementing known functions in ATLAS framework b.Understanding.
February 19th 2009AlbaNova Instrumentation Seminar1 Christian Bohm Instrumentation Physics, SU Upgrading the ATLAS detector Overview Motivation The current.
FTK poster F. Crescioli Alberto Annovi
The SLHC and the Challenges of the CMS Upgrade William Ferguson First year seminar March 2 nd
Tracking at the ATLAS LVL2 Trigger Athens – HEP2003 Nikos Konstantinidis University College London.
Faster tracking in hadron collider experiments  The problem  The solution  Conclusions Hans Drevermann (CERN) Nikos Konstantinidis ( Santa Cruz)
Optimising Cuts for HLT George Talbot Supervisor: Stewart Martin-Haugh.
HEP 2005 WorkShop, Thessaloniki April, 21 st – 24 th 2005 Efstathios (Stathis) Stefanidis Studies on the High.
Studies on stand-alone Si tracking with SVT Alberto, Alessandro, Pierluigi.
The CDF Online Silicon Vertex Tracker I. Fiori INFN & University of Padova 7th International Conference on Advanced Technologies and Particle Physics Villa.
Tracking at Level 2 for the ATLAS High Level Trigger Mark Sutton University College London 26 th September 2006.
AMB HW LOW LEVEL SIMULATION VS HW OUTPUT G. Volpi, INFN Pisa.
Hit rate at high luminosity logical channels - ghosts – efficiency Toy Monte Carlo : # I have assumed a uniform particle distribution inside the TS # I.
The CMS detector as compared to ATLAS CMS Detector Description –Inner detector and comparison with ATLAS –EM detector and comparison with ATLAS –Calorimetric.
FTK SIMULATION G. Volpi. Fast Tracker Processor Reminder The FTK processor will provide full tracking for each Lvl1 accept (100 kHz) Expected latency.
Fast Tracking of Strip and MAPS Detectors Joachim Gläß Computer Engineering, University of Mannheim Target application is trigger  1. do it fast  2.
ATLAS Trigger Development
Overview of the High-Level Trigger Electron and Photon Selection for the ATLAS Experiment at the LHC Ricardo Gonçalo, Royal Holloway University of London.
1 FTK AUX Design Review Functionality & Specifications M. Shochet November 11, 2014AUX design review.
ATLAS and the Trigger System The ATLAS (A Toroidal LHC ApparatuS) Experiment is one of the four major experiments operating at the Large Hadron Collider.
The Detector Performance Study for the Barrel Section of the ATLAS Semiconductor Tracker (SCT) with Cosmic Rays Yoshikazu Nagai (Univ. of Tsukuba) For.
LCWS11 – Tracking Performance at CLIC_ILD/SiD Michael Hauschild - CERN, 27-Sep-2011, page 1 Tracking Performance in CLIC_ILD and CLIC_SiD e + e –  H +
Tommaso Boccali SNS and INFN Pisa Vertex 2002 Kailua-Kona, Hawaii 3-8 November 2002 High Level Triggers at CMS with the Tracker.
A Fast Hardware Tracker for the ATLAS Trigger System A Fast Hardware Tracker for the ATLAS Trigger System Mark Neubauer 1, Laura Sartori 2 1 University.
Performances of the upgraded SVT The Silicon Vertex Trigger upgrade at CDF J.Adelman 1, A.Annovi 2, M.Aoki 3, A.Bardi 4, F.Bedeschi 4, S.Belforte 5, J.Bellinger.
Living Long At the LHC G. WATTS (UW/SEATTLE/MARSEILLE) WG3: EXOTIC HIGGS FERMILAB MAY 21, 2015.
System Demonstrator: status & planning The system demonstrator starts as “vertical slice”: The vertical slice will grow to include all FTK functions, but.
The BTeV Pixel Detector and Trigger System Simon Kwan Fermilab P.O. Box 500, Batavia, IL 60510, USA BEACH2002, June 29, 2002 Vancouver, Canada.
FTK high level simulation & the physics case The FTK simulation problem G. Volpi Laboratori Nazionali Frascati, CERN Associate FP07 MC Fellow.
Associative Memory design for the Fast Track processor (FTK) at Atlas I.Sacco (Scuola Superiore Sant’Anna) On behalf Amchip04 project (A. Annovi, M. Beretta,
Future evolution of the Fast TracKer (FTK) processing unit C. Gentsos, Aristotle University of Thessaloniki FTK FP7-PEOPLE-2012-IAPP FTK executive.
Status of FTK Paola Giannetti INFN Pisa for the FTK Group ATLAS Italia November 17, 2009.
GUIDO VOLPI – UNIVERSITY DI PISA FTK-IAPP Mid-Term Review 07/10/ Brussels.
New AMchip features Alberto Annovi INFN Frascati.
Outline The Pattern Matching and the Associative Memory (AM)
The Associative Memory Chip
Using IP Chi-Square Probability
More technical description:
Project definition and organization milestones & work-plan
An online silicon detector tracker for the ATLAS upgrade
2018/6/15 The Fast Tracker Real Time Processor and Its Impact on the Muon Isolation, Tau & b-Jet Online Selections at ATLAS Francesco Crescioli1 1University.
Pending technical issues and plans to address and solve
Overview of the ATLAS Fast Tracker (FTK) (daughter of the very successful CDF SVT) July 24, 2008 M. Shochet.
Michele Pioppi* on behalf of PRIN _005 group
FTK variable resolution pattern banks
The Silicon Track Trigger (STT) at DØ
High Level Trigger Studies for the Efstathios (Stathis) Stefanidis
SVT detector electronics
A Fast Hardware Tracker for the ATLAS Trigger System
The LHCb Level 1 trigger LHC Symposium, October 27, 2001
Samples and MC Selection
SVT detector electronics
Presentation transcript:

G. Volpi - INFN Frascati ANIMMA 2011

Search for rare SM or predicted BSM processes push the colliders intensity to new frontiers Rare processes are overwhelmed by well-known processes 8/9 order of magnitudes between Higgs and total cross-section Need to prioritize the physics output and leave flexibility for the unexpected Need sophisticated techniques to maximize the bandwidth for interesting events Several strategies are used, track trigger showed good results at CDF (SVT), ATLAS implementation (FTK) can have similar success

In FTK tracking divided into two separated steps The pattern matching uses a large bank of patterns and special hardware The track’s parameters are evaluated using a linear Principal Component Analysis algorithm (j.nima ) In FTK tracking divided into two separated steps The pattern matching uses a large bank of patterns and special hardware The track’s parameters are evaluated using a linear Principal Component Analysis algorithm (j.nima ) An associative memory (AM) chip allows a full parallel search in the pattern bank. Similar to commercial CAMs. The hits in a road are combined and the parameter evaluation is reduced to a linear problem, efficiently solved in an FPGA

FTK processor will read the ID for each Level 1 accept To improve the input bandwidth the ID is divided into 8 regions Each region will have 16 processing units, all working in parallel A total of about 1 Giga patterns The device is able to produce a complete list of tracks in tens of microseconds 3 pixel layers 4 double sided strip layers Up to 11 layers 3 pixel layers 4 double sided strip layers Up to 11 layers

 A large segmentation (SS) improves the pattern recognition efficiency  More likely that noisy hits enter the road: fake tracks  Or random combinations seem to be aligned in pattern: fake roads  Reducing the segmentation has benefits  Fake roads or tracks are less probable  But more hardware, more money 3 patterns, 3 roads (1 fake), 4 tracks (2 fakes) 4 patterns, 2 roads, 2 tracks, no fakes SS

90% # of patterns in Amchips (barrel only, 45  degress) 65M500M Pattern size r-  : 24 pixel; 20 SCT; 36 pix z Pattern size r-  : 12 pixel; 10 SCT; 36 pix z (1.2 mm)(1.6 mm)(14 mm) (0.6 mm) (0.8 mm) (14 mm) The bank with the larger SS size can be 90% efficient with a limited number of patterns but needs a greater output bandwidth, not possible in high luminosity events. = 342k = 40k Pixel and SCT unit is the number of adjacent channels

 Patterns can be generated at the finest resolution and grouped according to the low resolution granularity  A tree organization is natural  AM chip size is a function of the low resolution granularity  Limited number of patterns  Efficiency and fake rate driven by the granularity in the leaves  Final pattern recognition uses the full precision  AM patterns usually have a limited number of leaves  Most of the internal volume unused 7-layer example, maximum number of allowed nodes 2 7 =128. Few % of the internal volume used at TSP level

 TSP simulation implemented  The AM chip simulation finds the low resolution roads  For each AM road all the nodes are compared looking for matches  WH events with 75 pileup-event simulation used  Simulation results confirm TSP can reject large number of roads  Most of the fired roads have few sub- patterns  Special attention to this category is justified Difference made by fake AM roads, rejected at TSP stage AM roads found AM roads at TSP level

 To have a more flexible AM bank the SS are stored at maximum precision  Each additional bit halves the size of the SS  An additional bit is set if the match stops before the least significant bits, not using the full precision: “don’t care” bit like modern CAM memories ( K. Pagiamtzis and A. Sheikholeslami, Solid-State Circuits, IEEE Journal of, vol. 41, no. 3, 2006)  Where the full precision is used (no DC) a portion of the SS is vetoed  Where the DC is set the whole SS is active  The use of DC allows a reduction in the active region of the patterns  This reduces the probability of fake roads and tracks  Reducing the number of roads in the output Pattern in AM chip w/o the DC Pattern in AM chip w/ the DC DC set

 FTK simulation improved to include DC and TSP  TSP bank produced using 7 inner detector layers  Thin patterns grouped within the large patterns doubling the SS size: 1 DC bit  Working point fixed at 90% TSP efficiency  Typical TSP  AM reduction 1/3  Increment of area used in the AM chip 1/15=7%  Physics sample used: WH with full ATLAS simulation  Multi-jet events with high number of tracks  3 pileup scenarios at 25 ns bunch spacing are evaluated:  17.6, 40.5 and 75 pileup events  For each pileup scenario the number of roads per processing unit is important  Number extrapolated from barrel only simulation

AM size 2 MP TSP size 5 MP AM size 32 MP TSP size 100 MP 50% 95% Median

Number of output roads Pileup events AMAM w/ DC AM w/ TSP TSPAM bank size M M M Pattern bank reduction factor: A bank with DC capability reduces the fakes by a large factor: 5-7 Good performance without adding further hardware AM size 138 MP TSP size 384 MP

 Rapid tracking is an opportunity for the ATLAS experiment  FTK based on a successful technology (SVT)  But moving from 2 32 to needs new ideas  Variable resolution is a general idea  The patterns are able to change in shape and matching volume  Improves the precision only where needed  Just using a single DC bit has a significant effect  The number of roads out of the AM chip is reduced greatly by the DC  It has almost the same effect as a complete TSP  7% more information in the bank has the same power as a bank 3 times bigger  Use of several DC bits possible in the chip and a study is ongoing

ROD output sent to FTK at L1 rate FTK:  Operates in parallel with silicon readout after each L1 trigger  Reconstructs tracks over entire inner detector (|η|<2.5) in ~25μs (for 3x10 34 cm 2 s -1 Luminosity)  Provides high-quality tracks by the beginning of L2 trigger processing Both trigger levels benefit:  L1: events needing L2 tracking could have a higher fraction of the L1 rate  L2: with tracking already performed, the extra CPU time can be used for more advanced algorithms <2.5μs (HW) <20ms (CPUs) ~sec

 After the construction of the tree the content of the AM patterns is used  If in one layer all the nodes shares the same portion, the DC is not set  Shrinking the active part of the AM pattern  If all the portions are used in the nodes, the DC is set 16 TSP patterns AM pattern DC The smaller the number of TSP nodes, smaller the use of DC