Cargando…

CompassUT : study of a GPU track reconstruction for LHCb upgrades

We present a fast, data-oriented GPU tracking algorithm, CompassUT, as a potential option to cope with the expected throughput of 40Tbit/s for LHCb upgrade. We present a parallel version of the raw input decoding, optimized for SIMD architectures. We sort the hits by X and Y into group sectors while...

Descripción completa

Detalles Bibliográficos
Autor principal: Fernandez Declara, Placido
Lenguaje:eng
Publicado: 2019
Acceso en línea:http://cds.cern.ch/record/2665033
_version_ 1780961923621191680
author Fernandez Declara, Placido
author_facet Fernandez Declara, Placido
author_sort Fernandez Declara, Placido
collection CERN
description We present a fast, data-oriented GPU tracking algorithm, CompassUT, as a potential option to cope with the expected throughput of 40Tbit/s for LHCb upgrade. We present a parallel version of the raw input decoding, optimized for SIMD architectures. We sort the hits by X and Y into group sectors while decoding, to have a fast sorting and searching of the hits. We implement the tracking by reducing the memory footprint, reducing branching to a minimum and making the algorithm data-oriented for SIMD architectures. We show the achieved throughput in a variety of consumer and server GPUs, and present the impact on both the computing and physics performance for different configurations of the algorithm.
id cern-2665033
institution Organización Europea para la Investigación Nuclear
language eng
publishDate 2019
record_format invenio
spelling cern-26650332019-09-30T06:29:59Zhttp://cds.cern.ch/record/2665033engFernandez Declara, PlacidoCompassUT : study of a GPU track reconstruction for LHCb upgradesWe present a fast, data-oriented GPU tracking algorithm, CompassUT, as a potential option to cope with the expected throughput of 40Tbit/s for LHCb upgrade. We present a parallel version of the raw input decoding, optimized for SIMD architectures. We sort the hits by X and Y into group sectors while decoding, to have a fast sorting and searching of the hits. We implement the tracking by reducing the memory footprint, reducing branching to a minimum and making the algorithm data-oriented for SIMD architectures. We show the achieved throughput in a variety of consumer and server GPUs, and present the impact on both the computing and physics performance for different configurations of the algorithm.Poster-2019-680oai:cds.cern.ch:26650332019-02-27
spellingShingle Fernandez Declara, Placido
CompassUT : study of a GPU track reconstruction for LHCb upgrades
title CompassUT : study of a GPU track reconstruction for LHCb upgrades
title_full CompassUT : study of a GPU track reconstruction for LHCb upgrades
title_fullStr CompassUT : study of a GPU track reconstruction for LHCb upgrades
title_full_unstemmed CompassUT : study of a GPU track reconstruction for LHCb upgrades
title_short CompassUT : study of a GPU track reconstruction for LHCb upgrades
title_sort compassut : study of a gpu track reconstruction for lhcb upgrades
url http://cds.cern.ch/record/2665033
work_keys_str_mv AT fernandezdeclaraplacido compassutstudyofagputrackreconstructionforlhcbupgrades