1 / 7

Multiplicities and L0L1

Multiplicities and L0L1. SPD puzzle: TDR vs GlobalRobustness Velo clusters puzzle: L1 vs Offline L1 timing. Greetings from Elba…. SPD puzzle. Global Rob. Test (Bv18r0): Expect more hits due to ~18% increase in particle multiplicity, compared to nominal settings (Bv17r4)

mae
Download Presentation

Multiplicities and L0L1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Multiplicities and L0L1 • SPD puzzle: TDR vs GlobalRobustness • Velo clusters puzzle: L1 vs Offline • L1 timing Greetings from Elba…

  2. SPD puzzle Global Rob. Test (Bv18r0): • Expect more hits due to ~18% increase in particle multiplicity, compared to nominal settings (Bv17r4) • Find less in L0 SPD multiplicity variable !? • Explanation: SPD gain was changed in between • We should compare Global test to Velo test  OK! (ouf!)

  3. Velo Clusters Puzzle • L1and Offline velo clusters behave quite differently for the various robustness tests… • Remember: L1 clusters are summed without the 8 backwards phi sensors • Noise+Spillover clusters on the next slide…

  4. Velo clusters: continued Select elastic events with single interaction: only noise and spillover clusters (no signal) Definitely, there is something to be understood here…

  5. (~arbitrary) cut Outliers: large multiplicity ? Discussion on the next slide!

  6. L1 processing time (Since I am not present today, I may dare to talk for the first time about absolute processing times…) Time only Level1 algorithm (removed L1ReadInMemory) : • Average is ~ 9 ms with the combined timing ! • Pro memoria: • USER = system time corrected, • ELAP = real time, • Combined means: if | tUSER- tELAP | < 5 ms, then use tELAP , else use tUSER • USER time gives larger average value: ~ 12 ms • ELAP time: average depends on where one cuts … 7 – 26 ms Some caveats: • Averaging over widely different CPUs  unexpected results. Thus, restrict to “homogeneous” CPU sample by cutting on normalisation loop: here, 1 GHz lxplus Pentii, I believe (but to be checked). • Outliers: The few very large tUSER events do not correspond to large multiplicity, see next slide … to be taken under the magnifying glass after my vacation.

  7. L1 time “Outliers” • Huge L1 USER time (outliers, in yellow) does not seem to be due to large multiplicity … to be looked at!

More Related