P latform stability and track-fit problems M. Moulson, T. Spadaro, P. Valente Tracking Meeting, 18 Jul 2001.

Slides:



Advertisements
Similar presentations
CS 245Notes 71 CS 245: Database System Principles Notes 7: Query Optimization Hector Garcia-Molina.
Advertisements

Informed Search Methods How can we improve searching strategy by using intelligence? Map example: Heuristic: Expand those nodes closest in “as the crow.
Order Statistics Sorted
Silberschatz, Galvin and Gagne ©2007 Operating System Concepts with Java – 7 th Edition, Nov 15, 2006 Chapter 6 (a): Synchronization.
SiD PFA Status and Calorimeter Performance Ron Cassell (SLAC) SiD Design Study Meeting 11/15/08.
Online learning, minimizing regret, and combining expert advice
Practice Quiz Question
Quick Sort, Shell Sort, Counting Sort, Radix Sort AND Bucket Sort
N. Saoulidou Fermilab 1 Update on track reconstruction in the Near Detector N. Saoulidou, Fermilab
Learning Objectives Explain similarities and differences among algorithms, programs, and heuristic solutions List the five essential properties of an algorithm.
1Notes  Reference  Witkin and Baraff, “Physically Based Modelling” course, SIGGRAPH 2001  Link on the course website.
Complexity Analysis (Part I)
Pluto Building a large financial system in PERL. What is Pluto? Life insurance system Keeps track of mutual funds Handles accounts Handled EUR.
Computer Organization and Architecture
29 Mar 2007Tracking - Paul Dauncey1 Tracking/Alignment Status Paul Dauncey, Michele Faucci Giannelli, Mike Green, Anne-Marie Magnan, George Mavromanolakis,
Christopher Dougherty EC220 - Introduction to econometrics (chapter 4) Slideshow: nonlinear regression Original citation: Dougherty, C. (2012) EC220 -
Python Programming, 2/e1 Python Programming: An Introduction to Computer Science Chapter 3 Computing with Numbers.
PPR meeting - January 23, 2003 Andrea Dainese 1 TPC tracking parameterization: a useful tool for simulation studies with large statistics Motivation Implementation.
MdcPatRec Tracking Status Zhang Yao, Zhang Xueyao Shandong University.
Selective Block Minimization for Faster Convergence of Limited Memory Large-scale Linear Models Kai-Wei Chang and Dan Roth Experiment Settings Block Minimization.
August th Computer Olympiad1 Learning Opponent-type Probabilities for PrOM search Jeroen Donkers IKAT Universiteit Maastricht.
An Object-Oriented Approach to Programming Logic and Design Fourth Edition Chapter 5 Arrays.
1 CS 430 Database Theory Winter 2005 Lecture 16: Inside a DBMS.
MC/Offline Planning M. Moulson Frascati, 21 March 2005 MC status Reconstruction coverage and data quality Running time estimates MC & reprocessing production.
1 CSE 326: Data Structures: Hash Tables Lecture 12: Monday, Feb 3, 2003.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
Progress on BR(K L  p + p - ) using a double-tag method A. Antonelli, M. Antonelli, M. Dreucci, M. Moulson CP working group meeting, 25 Feb 2003.
DSP C5000 Chapter 16 Adaptive Filter Implementation Copyright © 2003 Texas Instruments. All rights reserved.
STAR Collaboration Meeting Rene Bellwied – Wayne State University July 2004 SVT Calibration and STI tracking status An update of work since the SVT review.
2005MEE Software Engineering Lecture 11 – Optimisation Techniques.
N. Saoulidou Fermilab 1 Status & Update of track reconstruction in the Near Detector N. Saoulidou, Fermilab
Update on replica management
K  group activities K + K - retracking features New vs Old : resolution future planning. Conclusion and outlook K + K - retracking features New vs Old.
V.Patera – KLOE GM – Otranto – 10 June 2002 K  reconstruction status K + K - retracking features New vs Old : resolution New vs Old : efficiencies Conclusion.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
CS4432: Database Systems II Query Processing- Part 2.
David Adams ATLAS DIAL: Distributed Interactive Analysis of Large datasets David Adams BNL August 5, 2002 BNL OMEGA talk.
CIAR Summer School Tutorial Lecture 1b Sigmoid Belief Nets Geoffrey Hinton.
Business Statistics for Managerial Decision Farideh Dehkordi-Vakil.
Access Queries Agenda 6/16/14 Review Access Project Part 1, answer questions Discuss queries: Turning data stored in a database into information for decision.
PESAsim – the e/  analysis framework Validation of the framework First look at a trigger menu combining several signatures Short-term plans Mark Sutton.
Invitation to Computer Science 6th Edition Chapter 3 The Efficiency of Algorithms.
Geant4 Tracking Test (D. Lunesu)1 Daniela Lunesu, Stefano Magni Dario Menasce INFN Milano GEANT4 TRACING TESTs.
Offline Status Report A. Antonelli Summary presentation for KLOE General Meeting Outline: Reprocessing status DST production Data Quality MC production.
METHOD OF STEEPEST DESCENT ELE Adaptive Signal Processing1 Week 5.
1 NONLINEAR REGRESSION Suppose you believe that a variable Y depends on a variable X according to the relationship shown and you wish to obtain estimates.
KalFitAlg: recent developments and tests WANG Dayong Jan.18,2006.
Optimization in Engineering Design 1 Introduction to Non-Linear Optimization.
CS 361 – Chapter 10 “Greedy algorithms” It’s a strategy of solving some problems –Need to make a series of choices –Each choice is made to maximize current.
Online Consumers produce histograms (from a limited sample of events) which provide information about the status of the different sub-detectors. The DQM.
STAR SVT Self Alignment V. Perevoztchikov Brookhaven National Laboratory,USA.
Status report on analysis of BR(K S  p + p - p 0 ) A. Antonelli, M. Moulson, Second KLOE Physics Workshop, Otranto, June 2002.
1 Reminder: Why reprocess? data Reconstruction: DBV DSTs: DBV data DBV-19 for reconstruction & DSTs, Run < DBV-20 for.
M. Ellis - MICE Collaboration Meeting - Wednesday 27th October Sci-Fi Tracker Performance Software Status –RF background simulation –Beam simulation.
Extrapolation Techniques  Four different techniques have been used to extrapolate near detector data to the far detector to predict the neutrino energy.
BEACH 04J. Piedra1 SiSA Tracking Silicon stand alone (SiSA) tracking optimization SiSA validation Matthew Herndon University of Wisconsin Joint Physics.
AliRoot survey: Calibration P.Hristov 11/06/2013.
11 Sep 2007Tracking - Paul Dauncey1 Tracking Code Paul Dauncey, Imperial College London.
Complexity Analysis (Part I)
Update on the false-dead DC wire problem
Chapter 16 Adaptive Filter Implementation
Tracking System at CERN 06 and 07 test beams
Chapter 5: Looping Starting Out with C++ Early Objects Seventh Edition
KLOE General Meeting - LNF March,
HPS Collaboration meeting, JLAB, Nov 16, 2016
DC monitoring - calibration - simulation - corrections
Wendy Taylor STT Meeting Fermilab September 28, 2001
Complexity Analysis (Part I)
Complexity Analysis (Part I)
Presentation transcript:

P latform stability and track-fit problems M. Moulson, T. Spadaro, P. Valente Tracking Meeting, 18 Jul 2001

Warning sign: platform dependence Test of DBV-10 on SunOS and AIX: Input: 1000 raw events Output in ksl stream: AIX: 11 events, incl. 3 not found on SunOS SunOS: 10 events, incl. 2 not found on AIX AIX or SunOS: 13 events Mostly KSTAG (one INTERTAG) 2 events found on both platforms with different length General caveat (?’s): Parameter space is huge; this is a quick survey Most tests done on very small (single-event) samples Tests should be done methodically once direction is clear

Where do the differences arise? Differences appear at track-fit level Reconstruction through PR identical including DTCE(1), DHRE(1) banks Differences appear in DBV-9 Test DBV’s 7, 8, 9, 10 on a single event (?) Reconstruction in general different in each version Same on AIX and SunOS platforms for DBV-7, 8 CVS history: changes in DBV-9 dconvr:Spatial resolutions from data vtxfin:Various small bug fixes Suspect effect from new parameterization of hit resolution

First-crack diagnostics Cannot eliminate effect just by switching off algorithms Kink finding, track joining, M.S., hit add./rej., etc. Hit flipping not switchable Fine t-s relations a possible exception Known changes correspond to onset of differences (?) Provide a plausible mechanism for effect Cannot eliminate effect by disabling code-optimization

Summary of first-crack diagnostics Input: 1000 raw events from run Table summarizes differences in ksl stream Opt.Fine t-sOther Algorith. In common Only SunOS Only AIXDiff evt. length Notes 811 y73 y812 yy9213 yyy8232 Standard config no res.y8331 Not binning of res. curves

DFITER: Fundamental track-fit routine DFITER DFBCOR DFTRAC DFDRV LEQU64 i < 1 c 2 > c 2 (old) Dc 2 < cut Max iter?FAILED CONVERGED Get space points from track pars. (q) Time-space conversion Get residuals, c 2, V = d c 2 /dq V d q = q; q = q + d q

Issues with DFITER and call limits DFITER called at various points at start of event after each hit flipped in DFLIP after DFMUSC, DFDEDX, etc. at end of event Max iterations in a single call: 8 On failure, convergence criterion relaxed and called again up to 15 times per track from most places up to 15 times more for dE/dx and at end of event Most tracks reconstructed differently show convergence problems

Beginnings of an explanation Track End Hits Tries DFITER End Tries Hits Tries DFITER End Tries Other Alg At first call to DFITER, parameters different by Inside DFITER, after LEQU64, difference increases to Differences accumulate with each call to DFITER Eventually jump bins in fine t-s Differences in % Problem exacerbated when convergence difficult Most critical track parameter: z Can diverge by tens of cm, esp. in DFLIP DFLIP

Notes on machine precision Why do we see differences at level at input to DFITER? In principle possible to have exact agreement between platforms for single calculation In practice depdends on optimization, autopromotion, rounding modes E.g., AIX: our standard compiler flags do not round in single precision but autopromote single to double Fair amount of code before this point; numerical errors accumulate rapidly Part of solution will involve: Tuning compilation parameters Promoting key parts of track fit to double precision NB: Matrix inversion already in double, looks OK Worst case: V -1 V = 1 to within < (diag), (off diag)

Problems with DFLIP DFLIP Get hits to flip Store track pars. DFITER (15 times) Sort; pick worst Flip hit c 2 < input Restore track pars. Return 1. Residuals and drift distances not updated if hit not flipped Basis for choice of next hit to flip Always assume previous hit was flipped 2. Failed DFITER calls count against max. retries Looser convergence if lots of hits to flip (lots of failures) Fewer calls to DFITER allowed If a hit won’t flip, do we want to retry? 3. Criterion for keeping flip: c 2 < input c 2 Flip is kept even if c 2 worse than best so far 4. More subjective issues No use of information on z- progression?

A possible wish list More study of the problem More sensible calling strategy for DFITER Small fixes to DFLIP (for now) Use l/2 instead of sampling for small drift distances Double precision at key points Compiler flags to consistently handle numerical inaccuracy Smoothing of t-s relations, resolution curves Evaluate efficacy of changes based on: parameter resolution, track c 2, L/R resolution accuracy, track splitting, machine stability While monitoring traditional quantities: efficiency, hit efficiency, purity, CPU time

A final note: Time is critical! August downtime will be only point in near future when large-scale reprocessing possible