Small SIMD Matrices for CERN High Throughput Computing

Abstract : System tracking is an old problem and has been heavily optimized throughout the past. However, in High Energy Physics, many small systems are tracked in real-time using Kalman filtering and no implementation satisfying those constraints currently exists. In this paper, we present a code generator used to speed up Cholesky Factorization and Kalman Filter for small matrices. The generator is easy to use and produces portable and heavily optimized code. We focus on current SIMD architectures (SSE, AVX, AVX512, Neon, SVE, Altivec and VSX). Our Cholesky factorization outperforms any existing libraries: from x3 to x10 faster than MKL. The Kalman Filter is also faster than existing implementations, and achieves 4e9 iter/s on a 2x24C Intel Xeon.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01760260
Contributor : Florian Lemaitre <>
Submitted on : Friday, April 6, 2018 - 10:38:50 AM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

File

final-draft.pdf
Files produced by the author(s)

Identifiers

Citation

Florian Lemaitre, Benjamin Couturier, Lionel Lacassagne. Small SIMD Matrices for CERN High Throughput Computing. WPMVP 2018 Workshop on Programming Models for SIMD/Vector Processing, Feb 2018, Vienna, Austria. ⟨10.1145/3178433.3178434⟩. ⟨hal-01760260⟩

Share

Metrics

Record views

138

Files downloads

599