Steven Lantz
YOU?
Author Swipe
View article: Exploring code portability solutions for HEP with a particle tracking test code
Exploring code portability solutions for HEP with a particle tracking test code Open
Traditionally, high energy physics (HEP) experiments have relied on x86 CPUs for the majority of their significant computing needs. As the field looks ahead to the next generation of experiments such as DUNE and the High-Luminosity LHC, th…
View article: Exploring code portability solutions for HEP with a particle tracking test code
Exploring code portability solutions for HEP with a particle tracking test code Open
Traditionally, high energy physics (HEP) experiments have relied on x86 CPUs for the majority of their significant computing needs. As the field looks ahead to the next generation of experiments such as DUNE and the High-Luminosity LHC, th…
View article: Generalizing mkFit and its Application to HL-LHC
Generalizing mkFit and its Application to HL-LHC Open
mkFit is an implementation of the Kalman filter-based track reconstruction algorithm that exploits both threadand data-level parallelism. In the past few years the project transitioned from the R&D phase to deployment in the Run-3 offline …
View article: Generalizing mkFit and its Application to HL-LHC
Generalizing mkFit and its Application to HL-LHC Open
mkFit is an implementation of the Kalman filter-based track reconstruction algorithm that exploits both thread- and data-level parallelism. In the past few years the project transitioned from the R&D phase to deployment in the Run-3 offlin…
View article: Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs
Parallelizing the Unpacking and Clustering of Detector Data for Reconstruction of Charged Particle Tracks on Multi-core CPUs and Many-core GPUs Open
We present results from parallelizing the unpacking and clustering steps of the raw data from the silicon strip modules for reconstruction of charged particle tracks. Throughput is further improved by concurrently processing multiple event…
View article: Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm
Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm Open
One of the most computationally challenging problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is finding and fitting particle tracks during event reconstruction. Algorithms used at the LHC today rely on Kalman filter…
View article: Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm
Reconstruction of Charged Particle Tracks in Realistic Detector Geometry Using a Vectorized and Parallelized Kalman Filter Algorithm Open
One of the most computationally challenging problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is finding and fitting particle tracks during event reconstruction. Algorithms used at the LHC today rely on Kalman filter…
View article: Speeding up Particle Track Reconstruction in the CMS Detector using a Vectorized and Parallelized Kalman Filter Algorithm
Speeding up Particle Track Reconstruction in the CMS Detector using a Vectorized and Parallelized Kalman Filter Algorithm Open
Building particle tracks is the most computationally intense step of event reconstruction at the LHC. With the increased instantaneous luminosity and associated increase in pileup expected from the High-Luminosity LHC, the computational ch…
View article: Speeding up Particle Track Reconstruction in the CMS Detector using a\n Vectorized and Parallelized Kalman Filter Algorithm
Speeding up Particle Track Reconstruction in the CMS Detector using a\n Vectorized and Parallelized Kalman Filter Algorithm Open
Building particle tracks is the most computationally intense step of event\nreconstruction at the LHC. With the increased instantaneous luminosity and\nassociated increase in pileup expected from the High-Luminosity LHC, the\ncomputational…
View article: Parallelized and Vectorized Tracking Using Kalman Filters with CMS Detector Geometry and Events
Parallelized and Vectorized Tracking Using Kalman Filters with CMS Detector Geometry and Events Open
The High-Luminosity Large Hadron Collider at CERN will be characterized by greater pileup of events and higher occupancy, making the track reconstruction even more computationally demanding. Existing algorithms at the LHC are based on Kalm…
View article: Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Architectures
Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Architectures Open
Faced with physical and energy density limitations on clock speed, contemporary microprocessor designers have increasingly turned to on-chip parallelism for performance gains. Algorithms should accordingly be designed with ample amounts of…
View article: Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on\n Many-Core Architectures
Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on\n Many-Core Architectures Open
Faced with physical and energy density limitations on clock speed,\ncontemporary microprocessor designers have increasingly turned to on-chip\nparallelism for performance gains. Algorithms should accordingly be designed\nwith ample amounts…
View article: Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs
Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Processors and GPUs Open
For over a decade now, physical and energy constraints have limited clock\nspeed improvements in commodity microprocessors. Instead, chipmakers have been\npushed into producing lower-power, multi-core processors such as GPGPU, ARM and\nInt…
View article: Kalman Filter Tracking on Parallel Architectures
Kalman Filter Tracking on Parallel Architectures Open
Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors such as GPGPU, ARM and Intel MIC. In order to achieve the theoretical p…
View article: Kalman Filter Tracking on Parallel Architectures
Kalman Filter Tracking on Parallel Architectures Open
Power density constraints are limiting the performance improvements of modern\nCPUs. To address this we have seen the introduction of lower-power, multi-core\nprocessors, but the future will be even more exciting. In order to stay within\n…
View article: Traditional Tracking with Kalman Filter on Parallel Architectures
Traditional Tracking with Kalman Filter on Parallel Architectures Open
Power density constraints are limiting the performance improvements of modern CPUs. To address this, we have seen the introduction of lower-power, multi-core processors, but the future will be even more exciting. In order to stay within th…