FTKSIM with rawhits Last week's updates October 9, 2007 Anton Kapliy.

Slides:



Advertisements
Similar presentations
MapReduce.
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.
Segmentation and Paging Considerations
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.
Jan. 2009Jinyuan Wu & Tiehui Liu, Visualization of FTK & Tiny Triplet Finder Jinyuan Wu and Tiehui Liu Fermilab January 2010.
Introduction to Excel 2007 Part 2: Bar Graphs and Histograms February 5, 2008.
Hit or Miss ? !!!.  Cache RAM is high-speed memory (usually SRAM).  The Cache stores frequently requested data.  If the CPU needs data, it will check.
LECTURE 13 OCT 18, 2010 A different take on more scripting stuff;& version control.
Track quality - impact on hardware of different strategies Paola FTK meeting Performances on WH and Bs   2.Now we use all the layers.
GLAST LAT Project Apr 1, 2005 E. do Couto e Silva 1/31 Overview of End to End Runs Eduardo do Couto e Silva April 1, 2005 ( not it is not a joke, we finally.
1 Athena Issues and B-tagging Efficiency Monica Dunford continuing the work of Meena Narain.
Chapter 3.7 Memory and I/O Systems. 2 Memory Management Only applies to languages with explicit memory management (C or C++) Memory problems are one of.
RawHits in Pixel/SCT Kohei Yorita The University of Chicago FTK Meeting on Feb. 21 st 2007.
7/14/2015EECS 584, Fall MapReduce: Simplied Data Processing on Large Clusters Yunxing Dai, Huan Feng.
Status of FTK simulation June 16,2005 G. Punzi, Pisa.
CS 333 Introduction to Operating Systems Class 19 - File System Performance Jonathan Walpole Computer Science Portland State University.
Simulation Tasks  Understanding Tracking  Understanding Hardware 1.Two types of tasks: a.Implementing known functions in ATLAS framework b.Understanding.
Tal Mor  Create an automatic system that given an image of a room and a color, will color the room walls  Maintaining the original texture.
BIT 285: ( Web) Application Programming Lecture 07 : Tuesday, January 27, 2015 Git.
Advanced Topics: MapReduce ECE 454 Computer Systems Programming Topics: Reductions Implemented in Distributed Frameworks Distributed Key-Value Stores Hadoop.
ASP.NET AJAX. Content ASP.NET AJAX Ajax Control Toolkit Muzaffer DOĞAN - Anadolu University2.
1 Thread Synchronization: Too Much Milk. 2 Implementing Critical Sections in Software Hard The following example will demonstrate the difficulty of providing.
Map Reduce: Simplified Data Processing On Large Clusters Jeffery Dean and Sanjay Ghemawat (Google Inc.) OSDI 2004 (Operating Systems Design and Implementation)
Testing. Definition From the dictionary- the means by which the presence, quality, or genuineness of anything is determined; a means of trial. For software.
Subversion. What is Subversion? A Version Control System A successor to CVS and SourceSafe Essentially gives you a tracked, shared file system.
The Linux Benchmark Project Randy Appleton Kurt Payne Joe Schmeltzer Carey Stortz
JAS3 + AIDA LC Simulations Workshop SLAC 19 th May 2003.
Gary MarsdenSlide 1University of Cape Town Principles of programming language design Gary Marsden Semester 2 – 2001.
DATA STRUCTURES AND ALGORITHMS Lecture Notes 7 Prepared by İnanç TAHRALI.
Obtaining Information From the Geologic Block Model
A Virtual Machine Monitor for Utilizing Non-dedicated Clusters Kenji Kaneda Yoshihiro Oyama Akinori Yonezawa (University of Tokyo)
15 Dec 2010 CERN Sept 2010 beam test: Sensor response study Chris Walmsley and Sam Leveridge (presented by Paul Dauncey) 1Paul Dauncey.
SWEN 302: AGILE METHODS Roma Klapaukh & Alex Potanin.
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
CVS – concurrent versions system Network Management Workshop intERlab at AIT Thailand March 11-15, 2008.
How to Build a CPU Cache COMP25212 – Lecture 2. Learning Objectives To understand: –how cache is logically structured –how cache operates CPU reads CPU.
Scaling up Decision Trees. Decision tree learning.
11 Sep 2009Paul Dauncey1 TPAC test beam analysis tasks Paul Dauncey.
AMB HW LOW LEVEL SIMULATION VS HW OUTPUT G. Volpi, INFN Pisa.
Games Development Game Architecture: Entities CO2301 Games Development 1 Week 22.
Karsten Köneke October 22 nd 2007 Ganga User Experience 1/9 Outline: Introduction What are we trying to do? Problems What are the problems? Conclusions.
G. Volpi - INFN Frascati ANIMMA Search for rare SM or predicted BSM processes push the colliders intensity to new frontiers Rare processes are overwhelmed.
CS333 Intro to Operating Systems Jonathan Walpole.
COMP SYSTEM ARCHITECTURE HOW TO BUILD A CACHE Antoniu Pop COMP25212 – Lecture 2Jan/Feb 2015.
FTKSim Status and plans FTK Meeting 07/13/2006 F. Crescioli, M. Dell'Orso, G. Punzi, G.Volpi, P. Giannetti.
HPC HPC-5 Systems Integration High Performance Computing 1 Application Resilience: Making Progress in Spite of Failure Nathan A. DeBardeleben and John.
Rawhits Status A short update on only pattgen “sector mode” Kohei Yorita University of Chicago March 13 th FTK Meeting.
for all Hyperion video tutorial/Training/Certification/Material Essbase Optimization Techniques by Amit.
SiD Detector Workshop at SLAC, October 26-28, 2006 Calorimeter Assisted Tracking Status Report Dmitry Onoprienko Kansas State University.
COMP091 – Operating Systems 1 Memory Management. Memory Management Terms Physical address –Actual address as seen by memory unit Logical address –Address.
ATLAS ATLAS muon CSC clustering David Adams Brookhaven National Laboratory June 15, 2006 Muon Software Updated 11:00 EDT June 15, 2006.
1 4 July 2006 Alan Barr - SCT DAQ Experience and plans from running the (SCT) DAQ at SR1 HEP Cosmics setup Running modes Problems Future.
D. Elia (INFN Bari)Offline week / CERN Status of the SPD Offline Domenico Elia (INFN Bari) Overview:  Response simulation (timing info, dead/noisy.
BIT 285: ( Web) Application Programming Lecture 07 : Tuesday, January 27, 2015 Git.
ANALYSIS TRAIN ON THE GRID Mihaela Gheata. AOD production train ◦ AOD production will be organized in a ‘train’ of tasks ◦ To maximize efficiency of full.
GUIDO VOLPI – UNIVERSITY DI PISA FTK-IAPP Mid-Term Review 07/10/ Brussels.
Ftksim at high luminosity Monthly meeting September 22, 2008 Anton Kapliy.
AP CSP: Pixelation – B&W/Color Images
Jonathan Walpole Computer Science Portland State University
More technical description:
Digital readout architecture for Velopix
FileSystems.
Muon Alignment: Organization
Requirements analysis, representation and validation
FTK variable resolution pattern banks
MapReduce Algorithm Design Adapted from Jimmy Lin’s slides.
road – Hough transform- c2
File System Implementation
Games Development Game Architecture: Entities
COMP755 Advanced Operating Systems
Presentation transcript:

FTKSIM with rawhits Last week's updates October 9, 2007 Anton Kapliy

Status Francesco came on Wed -> fixed bugs Ftksim works with rawhits (expt. hitwarrior)‏ Majority logic updated in ftksim & corrgen Major code cleanup (revert or leave?)‏  A lot of CDF-related code -> hard to follow  This code had useful ideas (timing, etc)‏  Can always pull it back from CVS  In particular, ftksim now has only LINFIT New config and map files  Consistent naming convention  Configuration/running script; full automation Committed code to CVS

Pattgen – memory issue Pattgen with rawhits 8 banks; each bank has size:  5x10mm – 110M  3x5mm – 320M  2x4mm – ??M, ran out of memory (8gb)‏ Possible solutions:  Split into more phi-wedges  Use constants->patterns (Francesco's work)‏ In long term, SS size will decrease more!

Roadwarrior update (FC)‏ Sometimes, two roads differ in only one SCT logical plane:  1 2 3; Now roadwarrior filters these cases, too  see new infrastructure in pmap_rd.h Implementable in hardware? Different SS's in 10 th logical plane

Need clustering Within a given road, we loop over all possible hit combinations, and now accept them all. Each pixel layer usually has 2-3 hits Large number of combs --> fake tracks: E E E E E From ftksim (raw hits): From ipat: d0,mmz0,mmphicot(theta)‏signed Ptchi2hitmasksector Will do clustering today/tomorrow. Particular suggestions? Idea: average x and y strips independently. What if there are 3 nearby hits?

Hitwarrior plans Do we need hitwarrior? - Will see after I put in clustering. That might be enough. Do we need tolerances (i.e. If |x1-x2|<AA, x1 and x2 are considered common hits)? Or just use the width of 1 pixel/SCT strip? Given two tracks that share 13/14 hits, do we accept both, or let hitwarrior choose best one? Etc... Or: can count number of common planes

Hitwarrior question In hardware, will it only compare tracks within a given road? Then it won't catch this: I.e, if clustering occurs on SS boundary, the same track may appear in two different roads. Maybe this effect is negligible? Layer 1 Layer 2 Layer 3 one SS

SP_7L_3x5, no hw A few fakes Weird curvature

raw_11L_3x5, no hw A lot more fakes Even more weird curvature

SP_7L_3x5, simple hw Tracks are considered common if #common hits > DIMSPA-NPLANES = 7 for SP, 3 for RAW Still weird curvature

RAW_11L_3x5, simple hw Tracks are considered common if #common hits > DIMSPA-NPLANES = 7 for SP, 3 for RAW PUNCHLINE: Both SP and RAWHIT are similar. Fakes were removed with hitwarrior Better solution: clustering Will it fix the curvature distribution??

New config system Added scripts to data/ directory (now in CVS)‏ Readme file: data/README.AK Main script: data/scripts/ftk.sh Concise naming convention for all files Maps in data/map_file; data/ss_file; etc Input data list in data/input/ Running full chain is as simple as:  ftk.sh -d raw_11L_3x5_training -a config  ftk.sh -d raw_11L_3x5_training -a sectors  ftk.sh -d raw_11L_3x5_training -a filter20  ftk.sh -d raw_11L_3x5_training -a patterns  ftk.sh -d raw_11L_3x5_training -a corrgen  ftk.sh -d raw_11L_3x5_bsmumu2 -a config  ftk.sh -d raw_11L_3x5_bsmumu2 -a ftksim  ftk.sh -d raw_11L_3x5_bsmumu2 -a merge  ftk.sh -d raw_11L_3x5_bsmumu2 -a comp Submits to a cluster, or runs locally