Cargando…
The Fast Tracker Real Time Processor
As the LHC luminosity is ramped up to the SLHC Phase I level and beyond, the high rates, multiplicities, and energies of particles seen by the detectors will pose a unique challenge. Only a tiny fraction of the produced collisions can be stored on tape and immense real-time data reduction is needed....
Autor principal: | |
---|---|
Lenguaje: | eng |
Publicado: |
2011
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1334833 |
_version_ | 1780921791822168064 |
---|---|
author | Annovi, A |
author_facet | Annovi, A |
author_sort | Annovi, A |
collection | CERN |
description | As the LHC luminosity is ramped up to the SLHC Phase I level and beyond, the high rates, multiplicities, and energies of particles seen by the detectors will pose a unique challenge. Only a tiny fraction of the produced collisions can be stored on tape and immense real-time data reduction is needed. An effective trigger system must maintain high trigger efficiencies for the physics we are most interested in, and at the same time suppress the enormous QCD backgrounds. This requires massive computing power to minimize the online execution time of complex algorithms. A multi-level trigger is an effective solution for an otherwise impossible problem. The Fast Tracker (FTK)[1], is a proposed upgrade to the current ATLAS trigger system that will operate at full Level-1 output rates and provide high quality tracks reconstructed over the entire detector by the start of processing in Level-2. FTK solves the combinatorial challenge inherent to tracking by exploiting massive parallelism of associative memories [2] that can compare inner detector hits to millions of pre-calculated patterns simultaneously. The tracking problem within matched patterns is further simplified by using pre-computed linearized fitting constants and leveraging fast DSPs in modern commercial FPGAs. Overall, FTK is able to compute the helix parameters for all tracks in an event and apply quality cuts in less than 100 microseconds. The system design is defined and st udied with respect to high-PT Level-2 objects: b-jets, tau-jets, and isolated leptons. We test FTK algorithms using ATLAS full simulation with WH events up to the Phase I luminosity and beyond, comparing FTK results with the offline tracking capability. We present the architecture and the reconstruction performance for the mentioned high-PT Level-2 objects. [1] A. Andreani et al., The Fast Tracker Real Time Processor and Its Impact on Muon Isolation, Tau and b-Jet Online Selections at ATLAS, Conference Record 17th IEEE NPSS Real Time Conference Record of the 17th Real Time Conference, Lisbon, Portugal, 24 - 28 May 2010. [2] A. Annovi et al., A VLSI Processor for Fast Track Finding Based on Content Addressable Memories, IEEE Trans. Nucl. Sci. 53, 2428 (2006) |
id | cern-1334833 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 2011 |
record_format | invenio |
spelling | cern-13348332019-09-30T06:29:59Zhttp://cds.cern.ch/record/1334833engAnnovi, AThe Fast Tracker Real Time ProcessorDetectors and Experimental TechniquesAs the LHC luminosity is ramped up to the SLHC Phase I level and beyond, the high rates, multiplicities, and energies of particles seen by the detectors will pose a unique challenge. Only a tiny fraction of the produced collisions can be stored on tape and immense real-time data reduction is needed. An effective trigger system must maintain high trigger efficiencies for the physics we are most interested in, and at the same time suppress the enormous QCD backgrounds. This requires massive computing power to minimize the online execution time of complex algorithms. A multi-level trigger is an effective solution for an otherwise impossible problem. The Fast Tracker (FTK)[1], is a proposed upgrade to the current ATLAS trigger system that will operate at full Level-1 output rates and provide high quality tracks reconstructed over the entire detector by the start of processing in Level-2. FTK solves the combinatorial challenge inherent to tracking by exploiting massive parallelism of associative memories [2] that can compare inner detector hits to millions of pre-calculated patterns simultaneously. The tracking problem within matched patterns is further simplified by using pre-computed linearized fitting constants and leveraging fast DSPs in modern commercial FPGAs. Overall, FTK is able to compute the helix parameters for all tracks in an event and apply quality cuts in less than 100 microseconds. The system design is defined and st udied with respect to high-PT Level-2 objects: b-jets, tau-jets, and isolated leptons. We test FTK algorithms using ATLAS full simulation with WH events up to the Phase I luminosity and beyond, comparing FTK results with the offline tracking capability. We present the architecture and the reconstruction performance for the mentioned high-PT Level-2 objects. [1] A. Andreani et al., The Fast Tracker Real Time Processor and Its Impact on Muon Isolation, Tau and b-Jet Online Selections at ATLAS, Conference Record 17th IEEE NPSS Real Time Conference Record of the 17th Real Time Conference, Lisbon, Portugal, 24 - 28 May 2010. [2] A. Annovi et al., A VLSI Processor for Fast Track Finding Based on Content Addressable Memories, IEEE Trans. Nucl. Sci. 53, 2428 (2006)ATL-DAQ-SLIDE-2011-080oai:cds.cern.ch:13348332011-03-09 |
spellingShingle | Detectors and Experimental Techniques Annovi, A The Fast Tracker Real Time Processor |
title | The Fast Tracker Real Time Processor |
title_full | The Fast Tracker Real Time Processor |
title_fullStr | The Fast Tracker Real Time Processor |
title_full_unstemmed | The Fast Tracker Real Time Processor |
title_short | The Fast Tracker Real Time Processor |
title_sort | fast tracker real time processor |
topic | Detectors and Experimental Techniques |
url | http://cds.cern.ch/record/1334833 |
work_keys_str_mv | AT annovia thefasttrackerrealtimeprocessor AT annovia fasttrackerrealtimeprocessor |