1 / 12

Improved Linked List Segment Reconstruction in Particle Physics

Introduction of major enhancements in the Linked List Segment Builder algorithm resulting in increased efficiencies and resolutions, with detailed analysis and calculations for the reconstruction process. Timing optimizations and error handling improvements highlighted.

curt
Télécharger la présentation

Improved Linked List Segment Reconstruction in Particle Physics

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. Linked List Segment Builder • Major improvements as of t01.53.00 • LL algorithm default in t01.54.00 • Efficiencies • Resolutions • Timing • Ran on single , 5-100 GeV Linked List Segment reconstruction O. Peters

  2. LL efficiency Total efficiency: 97.8% Linked List Segment reconstruction O. Peters

  3. Combi efficiency Total efficiency: 90.1% Linked List Segment reconstruction O. Peters

  4. Efficiency calculation • MC segment requires two wire hits • Reco segment is found when it is close (dR < 40 cm) to MC segment • Efficiency takes out geometrical acceptance • But includes hit reconstruction efficiency • PDT single wire efficiency: 95% • MDT wire efficiency: 99% • ‘Real’ efficiency: 98.3% Linked List Segment reconstruction O. Peters

  5. LL central resolution Linked List Segment reconstruction O. Peters

  6. Vertex constraint • Use vertex to constrain A-layer segment • Valid for low pT tracks? O Linked List Segment reconstruction O. Peters

  7. LL central resolution with vertex constraint Linked List Segment reconstruction O. Peters

  8. Combi central resolution (with vertex constraint) Linked List Segment reconstruction O. Peters

  9. LL forward resolution Linked List Segment reconstruction O. Peters

  10. LL forward resolution with vertex constraint Linked List Segment reconstruction O. Peters

  11. Combi forward resolution (with vertex constraint) Linked List Segment reconstruction O. Peters

  12. Timing & errors • Optimized build on d0mino • Linked List algorithm: 9 ms/ • Combinatorial: 12 ms/ • Time on L3 node: unknown • Estimate 3-4 times faster than d0mino • Errors on segment need work • But first figure out errors on hits! Linked List Segment reconstruction O. Peters

More Related