Sep. 10, 2004Hobbs1 STT Fitting and Luminosity Fitting hardware description Current situation –Processing time –Instantaneous Lumi Dependence Possible.

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

UK egamma meeting, Sept 22, 2005M. Wielers, RAL1 Status of Electron Triggers Rates/eff for different triggers Check on physics channels Crack region, comparison.
Efforts to Improve the Reconstruction of Non-Prompt Tracks with the SiD Lori Stevens UCSC ILC Simulation Reconstruction Meeting May 15, 2007 Includes contributions.
Hash-Based Indexes The slides for this text are organized into chapters. This lecture covers Chapter 10. Chapter 1: Introduction to Database Systems Chapter.
Memory Management Chapter 7.
Chapter 7 Memory Management Operating Systems: Internals and Design Principles, 6/E William Stallings Dave Bremer Otago Polytechnic, N.Z. ©2009, Prentice.
Quick Sort, Shell Sort, Counting Sort, Radix Sort AND Bucket Sort
1 Reconstruction of Non-Prompt Tracks Using a Standalone Barrel Tracking Algorithm.
Simulation Studies of a (DEPFET) Vertex Detector for SuperBelle Ariane Frey, Max-Planck-Institut für Physik München Contents: Software framework Simulation.
CDF CDF Operations Steve Hahn February 7, 2005 All Experimenters ’ Meeting.
The Silicon Track Trigger (STT) at DØ Beauty 2005 in Assisi, June 2005 Sascha Caron for the DØ collaboration Tag beauty fast …
1  trigger optimization in CMS Tracker Giuseppe Bagliesi On behalf of  tracking group Workshop on B/tau Physics at LHC Helsinki, May 30 - June 1, 2002.
1 N. Davidson E/p single hadron energy scale check with minimum bias events Jet Note 8 Meeting 15 th May 2007.
1 Hash-Based Indexes Yanlei Diao UMass Amherst Feb 22, 2006 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
September 27, 2005FAKT 2005, ViennaSlide 1 B-Tagging and ttH, H → bb Analysis on Fully Simulated Events in the ATLAS Experiment A.H. Wildauer Universität.
SpillServer and FD neutrino events As part of my CC analysis studies, I have been attempting to isolate beam neutrino candidates in the FD using both scanning.
Status of  b Scan Jianchun Wang Syracuse University Representing L b scanners CLEO Meeting 05/11/02.
Striplet option of Super Belle Silicon Vertex Detector Talk at Joint Super B factory workshop, Honolulu 20 April 2005 T.Tsuboyama.
Memory Management Chapter 5.
Secure Embedded Processing through Hardware-assisted Run-time Monitoring Zubin Kumar.
Chapter 3 Memory Management: Virtual Memory
The Track-Finding Processor for the Level-1 Trigger of the CMS Endcap Muon System D.Acosta, A.Madorsky, B.Scurlock, S.M.Wang University of Florida A.Atamanchuk,
Trigger design engineering tools. Data flow analysis Data flow analysis through the entire Trigger Processor allow us to refine the optimal architecture.
Demo. Overview Overall the project has two main goals: 1) Develop a method to use sensor data to determine behavior probability. 2) Use the behavior probability.
IT253: Computer Organization
Memory Management. Roadmap Basic requirements of Memory Management Memory Partitioning Basic blocks of memory management –Paging –Segmentation.
Test vs. inspection Part 2 Tor Stålhane. Testing and inspection A short data analysis.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Memory: Relocation.
ATLAS ATLAS Week: 25/Feb to 1/Mar 2002 B-Physics Trigger Working Group Status Report
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
AMB HW LOW LEVEL SIMULATION VS HW OUTPUT G. Volpi, INFN Pisa.
1 Memory Management Chapter 7. 2 Memory Management Subdividing memory to accommodate multiple processes Memory needs to be allocated to ensure a reasonable.
Database Management Systems, R. Ramakrishnan and J. Gehrke1 Hash-Based Indexes Chapter 10.
G. Volpi - INFN Frascati ANIMMA Search for rare SM or predicted BSM processes push the colliders intensity to new frontiers Rare processes are overwhelmed.
CMS WEEK – MARCH06 REVIEW OF MB4 COMMISSIONING DATA Giorgia Mila
01/20151 EPI 5344: Survival Analysis in Epidemiology Cox regression: Introduction March 17, 2015 Dr. N. Birkett, School of Epidemiology, Public Health.
PESAsim – the e/  analysis framework Validation of the framework First look at a trigger menu combining several signatures Short-term plans Mark Sutton.
December 16, 2005M Jones1 New Level 1 Track Triggers Outputs from SLAM provide lists of axial tracks plus associated stereo information Consider new Level.
FPGA-Based System Design: Chapter 6 Copyright  2004 Prentice Hall PTR Topics n Low power design. n Pipelining.
The DØ Silicon Track Trigger Wendy Taylor IEEE NSS 2000 Lyon, France October 17, 2000  Introduction  Overview of STT  STT Hardware Design u Motherboard.
Oct. 16, 1998Hobbs (thanks Hal)1 SMT Road Widths & Extra CFT Layers Current Situation Adding a 3rd CFT layer Using all 8 CFT layers Summary.
Search for High-Mass Resonances in e + e - Jia Liu Madelyne Greene, Lana Muniz, Jane Nachtman Goal for the summer Searching for new particle Z’ --- a massive.
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 +
Forward Trigger Upgrade and AuAu Pattern Recognition V. Cianciolo, D. Silvermyr Forward Upgrade Meeting August 18-19, 2004.
DN/d  and dN/dp T analysis status Gabor Veres for the working group QCD meeting, Jan 12, 2010.
COMP091 – Operating Systems 1 Memory Management. Memory Management Terms Physical address –Actual address as seen by memory unit Logical address –Address.
20 April 2002Bill Lee APS 1 The D0 Silicon Track Trigger Bill Lee Florida State 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.
Preliminary Design of Trigger System for BES III Zhen’an LIU Inst of High Energy Physics,Beijing Oct
1 D *+ production Alexandr Kozlinskiy Thomas Bauer Vanya Belyaev
Chapter 15 Running Time Analysis. Topics Orders of Magnitude and Big-Oh Notation Running Time Analysis of Algorithms –Counting Statements –Evaluating.
BEACH 04J. Piedra1 SiSA Tracking Silicon stand alone (SiSA) tracking optimization SiSA validation Matthew Herndon University of Wisconsin Joint Physics.
The BTeV Pixel Detector and Trigger System Simon Kwan Fermilab P.O. Box 500, Batavia, IL 60510, USA BEACH2002, June 29, 2002 Vancouver, Canada.
FNAL Software School Day 4 Matt Herndon, University of Wisconsin – Madison.
Noise results from SR1 combined SCT barrel tests Summary of some initial results Alan Barr, UCL Pepe Bernabeu, Valencia.
Pattern recognition with the triplet method Fabrizio Cei INFN & University of Pisa MEG Meeting, Hakata October /10/20131 Fabrizio Cei.
The LHCb Calorimeter Triggers LAL Orsay and INFN Bologna.
Overview Modern chip designs have multiple IP components with different process, voltage, temperature sensitivities Optimizing mix to different customer.
Yet another approach to the ToF-based PID at PANDA
SLP1 design Christos Gentsos 9/4/2014.
Overview of the ATLAS Fast Tracker (FTK) (daughter of the very successful CDF SVT) July 24, 2008 M. Shochet.
FTK variable resolution pattern banks
The Silicon Track Trigger (STT) at DØ
2006 Relative Luminosity Tai Sakuma MIT 3/19/2007.
Fast Track Fitting in the SiD01 Detector
The CMS Tracking Readout and Front End Driver Testing
road – Hough transform- c2
Operating Systems: Internals and Design Principles, 6/E
Wendy Taylor STT Meeting Fermilab September 28, 2001
Presentation transcript:

Sep. 10, 2004Hobbs1 STT Fitting and Luminosity Fitting hardware description Current situation –Processing time –Instantaneous Lumi Dependence Possible changes –Instantaneous Lumi Dependence –Processing time Summary Do we need to build more TFC’s at all? (and new hotlink merging card?)

Sep. 10, 2004Hobbs2 Fitting Hardware:TFC Fitting time considerations: 1. Buffer Occupancy (16 evts.) 2. Bus contention 3. Processing time *Subject to shared bus constraints RED = external connection DSP’s see only a “road”, not an event… Input, each DSP* and output are run in parallel including multi-events in DSP’s Input logic (coord/road) LUT PCI-A L3 FIFO + logic L2 ouput logic PCI-B PCI-C Input buffer Output buffer LUT DSP

Sep. 10, 2004Hobbs3 Fitting Hardware:TFC Input buffer Output buffer LUT DSP Input logic (coord/road) LUT PCI-A L3 FIFO + logic L2 ouput logic PCI-B PCI-C Input buffer Output buffer LUT DSP “Odd” roads “Even” roads 33 MHz 33/2 MHz Actually have 8 DSP’s/TFC as 2x4

Sep. 10, 2004Hobbs4 Look at Lumi Effects in Data Derive efficiency and purity with respect to reco+CTT tracks in STT acceptance Already seeing effects from instantaneous lumi STT per track Efficiency STT track Purity Thanks, Huishi 2 mm road(?) Data taken 7/14/04

Sep. 10, 2004Hobbs5 Efficiency vs. Rejection in MC 2 track trigger 1 track trigger Efficiency Rejection 100 Signal & background as defined later: Signal, bb final state Bkg, “uu” final state

Sep. 10, 2004Hobbs6 But, currently: Lots of Extra CPU Time Available Early queuing studies: 50  s mean fitting time is fine! Fitting Time,  s Fraction/  s L = 23e30 “No” tails Pass 1 pass 2 No fit = 16  s No “by hand” optimization, e.g. each hit seen 4x now, could logically reduce to 2x

Sep. 10, 2004Hobbs7 And buffer/logic occupancy low Lumi(e30) Mostly empty/idle at existing luminosities. Extended readout, 2x Easily tolerate very large increases everywhere in logic proc. and buffers These data are with extended read out mode, so higher occupancy

Sep. 10, 2004Hobbs8 Revised fit algorithm for Run 2B Higher inst. lumi means more hits. –What does this do to pattern recognition? –No effect on parameter calculation precision Use data and MC –Run 2A detector don’t expect Layer 0 to provide much patrec help Full software chain ready Look at relative effects Samples –Run 2 data (7/14/04) Run , L=62e30 Run , L=23e30 Run , L=15e30 –Run 2 MC, “b Signal” WH->mnbb 0.5 mb WH->mnbb 7.5 mb –Run 2 MC, “b Bkg” Z->udsuds 0.5 mb Z->udsuds 7.5 mb MC ala Uli’s earlier study MC, 2 ways: default, or remove ladders bad in data

Sep. 10, 2004Hobbs9 Look at ways to modify hit selection Current algorithm –Bounded exec time! –Uses “Static Road” Hits closest to circle though CFT-H, -A & beam spot –Require barrel order –Can skip 1 SMT superlayer –If 1 st fit is bad, drop a hit (if all 4 layers) New possibilities –Keep bounded time? –Try “Dynamic Road” Hits closest to circle through CFT-H, -A & an STT hit – Test barrel effects – Retain 1 layer skipping –Test different hit removal algorithms None, 1 st layer, …

Sep. 10, 2004Hobbs10 Two circle definition algorithms: Static Road (Current) Dynamic Road (D0 Note 3743) one circle for selection here, 2 circles Always choose hits closest to the circle… Hit Selection:Details CFT H CFT A Beam spot

Sep. 10, 2004Hobbs11 Hit Selection: Details In addition have limited z-information via barrel segmentation (allow at most 1 barrel transition) Do we first check all combinations, then select? r z Some Acceptable combinations r z Some unaccepable combinations

Sep. 10, 2004Hobbs12 Hit Selection: Details For either algorithm choose: 1. width in which to search: 1mm, 2mm 2. look at hits in valid barrel(z) combos only Choose what to do with 4 th SMT hit if bad 1 st pass fit? Refit after 1. Drop hit with worst  2 2. Drop inner layer (suggested by scanning) 3. Drop 1 st layer if 1 st or 2 nd layer is worst 4. Never Do or do not impose barrel ordering

Sep. 10, 2004Hobbs13 Fitting: Current algorithm Static road: use beam spot Road half-width: 1mm All hits-in-road (do not make list of hits in valid combinations before selection (time) Require barrel ordering If bad 1 st fit, drop hit with worst  2

Sep. 10, 2004Hobbs14 Make efficiency vs. rejection plots For example, 2 track trigger low & high lumi 3 “algorithms”, 1 track in trig. Have many, many curves… Rejection

Sep. 10, 2004Hobbs15 Choosing an algorithm Too many curves to overlay in a reasonable manner. So, make tables of rejection at specific efficiencies for  1 or  2 track(s) satisfying S b >X in trigger, low and high luminosities

Sep. 10, 2004Hobbs16 Rejection at  = 80% 1 Track 2 Track Processing Mode Algorithm Low High Low High Standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop inner Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits No barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Standard MC

Sep. 10, 2004Hobbs17 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits no barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Rejection at  = 70% Standard MC

Sep. 10, 2004Hobbs18 Rejection at  = 50% 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits no barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Standard MC

Sep. 10, 2004Hobbs19 Rejection at  = 20% 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits no barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Standard MC

Sep. 10, 2004Hobbs20 Hit Selection: An unbounded aside Allow unbounded execution time – Try all combinations – Save best  2 /road Compare with best of the other algorithms – use default MC Show rejection ratio Rejection “All Combos” Rejection “Standard” So >1 means “all” is better Rejection Ratios 1 Track 2 Track. Low High Low High E=80% % % % There are a few points with 15% increase in rejection, but most show significant loss

Sep. 10, 2004Hobbs21 Revised Algorithm Efficiency/Rejection will be lumi dependent Algorithm high effi: Dynamic low effi: Static Consistent pattern for both MC samples – all barrels live – good barrels live Best Choice Algorithm(  10%) Effi 1 Trk 2 Trk. 80% Dynamic Dynamic 1 not 2 1 not 2 70% Dynamic Dynamic 1 pass 1 not 2 50% Static Dynamic 1 pass 1 pass 20% Static Static 1 pass 1 pass

Sep. 10, 2004Hobbs22 Revised Algorithm What to do? – Can we make a decision about needing more TFC’s without actually choosing the algorithm today? Compare time of – dynamic road, all hits, 2 passes allowed (longest) – with current standard algorithm NB: Ignoring “valid combos” choice <10% in rejection, but much faster Choosing “wrong” road alg. is mild at high efficiency but 50% loss in rej at high rejections 2 nd pass algorithm could be chosen at run-time Hit rejection algorithms have modest impact on processing time, so focus on initial selection

Sep. 10, 2004Hobbs23 Comparison: 1 Track Req. Rejection Efficiency Default MC

Sep. 10, 2004Hobbs24 Comparison: 2 Track Req. Rejection Efficiency Default MC

Sep. 10, 2004Hobbs25 Dynamic Road, “1 st not 2 nd ”: Processing Time Hit Selection –Marginal increase, still fixed –Dynamic: Need one fit for each hit in minimum occupancy layer: +???% Layer 0 – Limited impact (+20% overall) – Linear in hit selection – Marginal change in parameter calculation 3x5 matrix -> 3x6 matrix Extra term in  2

Sep. 10, 2004Hobbs26 How many hits? Monte Carlo 7.5 minbias = 1.55 Current data 60e30. = 1.60

Sep. 10, 2004Hobbs27 Dynamic Road, 2 pass: Processing Time Hit Selection –Marginal increase, still no tails – Need one fit for each hit in minimum occupancy layer: +60% Layer 0 – Limited impact (<20% overall) – Linear in hit selection – Marginal change in parameter calculation 3x5 matrix -> 3x6 matrix Extra term in  2 Net: +80%, incl. extra hits and matrix for Layer0 Maybe processing time increases 2x? gives = 30  s still well below problem times

Sep. 10, 2004Hobbs28 What about occupancy? Roads/TFC – Current means All roads: 3.1/tfc/evt Fittable: 2.2/tfc/evt – 8-fold parallel CPU’s For < 8 tracks, small change in time Then for <16 small change – Doesn’t seem like a problem Hits/road – 15e30 to 60e30 gave +25% – similar factor for final luminosity, so if linear, another +25% Known code inefficiency – each hit looked at 4x, could be <= 2x – get hits in 2 mm, then discard those outside 1 mm. Compute dx for all… What about skip bit?

Sep. 10, 2004Hobbs29 What about occupancy? Use data sender with kludged high multiplicty evts to test – data vs. kludge (no spike) – send with Poisson interval – Event time (t fit = 34  s) Rate t evt (  s) (kHz) “Std” “Big” 2 kHz <>, Green = data <>, red = 2.5x data

Sep. 10, 2004Hobbs30 What would we save? Making exact copies of TFC’s – No firmware mods needed – All parts in hand. Need boards and assembly. Designing and building hotlink merge cards* –Have 0 th order layout. Finalize and order –Have draft firmware (JDH or new eng.) –Both based on existing board Building other boards? –Motherboards, LRB’s, LTB’s *or 2 more MBT’s + L2CTT software

Sep. 10, 2004Hobbs31 What would we not save? In any scenario, need to revise – software (incl. trigsim fitters) – LUT’s to accommodate Layer 0 Who? – Junjie Zhu, as a post doc (11/15) – Ken Herner, student (10/15) Both already familiar w/D0 – JDH – if build, 1 engineer (Chuck Pancake)

Sep. 10, 2004Hobbs32 Conclude Do not add additional TFC’s/crate Likely switch to Dynamic Road algorithm –2 nd pass definition can be tweaked… –Plan to use current except drop 1 st layer if 2 nd contributes most to  2 No matter which of these are used, none require more hardware

Sep. 10, 2004Hobbs33 Extras follow

Sep. 10, 2004Hobbs34 Rejection at  = 80% 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits No barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Ladder removed MC

Sep. 10, 2004Hobbs35 Rejection at  = 70% 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits No barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Ladder removed MC

Sep. 10, 2004Hobbs36 Rejection at  = 50% 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits No barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Ladder removed MC

Sep. 10, 2004Hobbs37 Rejection at  = 20% 1 Track 2 Track Processing Mode Algorithm Low High Low High standard Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits pass Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop 1 st not 2 nd Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Drop inner always Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits No barrel order Static Road, 2mm Static Road, 1mm Dynamic Road, all hits Dynamic Road, combo hits Ladder removed MC

Sep. 10, 2004Hobbs38 How many fits are multi-pass? Use highest lumi run from data, and use 7.5 mb MC As with previous, use trigsim and standard algorithm Plot dropped layer, with 0 meaning no drop. Use (current) 1 mm road 1 pass, 77% Run Skipped Layer 23% of fits (in data) require a 2 nd pass