### Speaker

Dr
Michael D. McCool
(Intel/University of Waterloo)

### Description

A great portion of data mining in a high-energy detector experiment is spent in the complementary tasks of track ﬁnding and track ﬁtting. These problems correspond, respectively, to
associating a set of measurements to a single particle, and to determining the parameters of the track given a candidate path [Avery 1992]. These parameters usually correspond to
the 5-tuple state of the model of motion of a charged particle in a magnetic ﬁeld.
Global algorithms for track ﬁtting have been superceded by recursive least-square estimation algorithms that, assuming the measurement noise is Gaussian, result in an optimal
estimate [Fr\"uwirth and Widl 1992]. However, this assumption hardly ever holds due to energy loss and multiple scattering. Extensions to the Kalman ﬁlter have been proposed and implemented [Fr\"uwirth 1997] that use sums of Gaussians to model non-Gaussian distributions. In addition, non-linear ﬁltering is necessary to eliminate the effects of outliers including misclassiﬁed measurements. Track ﬁtting based on sums of Gaussians can be implemented through an ensemble
of single Gaussian ﬁts, each of which is the result of a single Kalman ﬁlter [Gorbunov et al. 2008].
Efficient parallel implementations of these algorithms are also crucial due to the large amount of data that needs to be processed. Since many separate tracks need to be ﬁtted, the simplest way to parallelize the problem is to ﬁt many independent tracks at once. However, with the ensemble
algorithm is it also possible to parallelize across the ensemble within a single track ﬁt. Parallelism mechanisms available in the hardware include multiple nodes and multiple cores.
Prior implementations can also make use of the SIMD vector units present in most modern CPUs [Gorbunov et al. 2008]. We have performed an implementation of the ensemble approach using Ct. Ct is a generalized data-parallel programming platform that can efficiently target both multiple
cores and SIMD vector units from a single high-level speciﬁcation in C++. Compared to the earlier SIMD implementation, Ct allows for hardware and instruction set portability.
We have obtained scalable speedup with respect to a scalar baseline implemented using both single and double precision. In the prior work, a speedup of 1.6x for scalar vs. vectorized versions of the algorithm were reported for double precision. Our results are comparable to these.
In addition, we have explored the implementation of sequential Monte Carlo in Ct using particle ﬁltering to model arbitrary probabality distributions. However, one challenge in this context is the computation of the likelihood function, which requires estimates of the measurement error for every
measurement and their correlation.
References
Avery, P. 1992. Applied ﬁtting theory V: Track ﬁtting using the Kalman ﬁlter. Tech. rep.
Fr\"uuwirth, R., and Widl, E. 1992. Track-based alignment using a Kalman ﬁlter technique. Communications in Computational Physics .
Fr\"uwirth, R. 1997. Track-ﬁtting with non-Gaussian noise. Communications in Computational Physics (Jan.).
Gorbunov, S., Kebschull, U., Kisel, I., Lindenstruth, V., and M\"uller, W. F. J. 2008. Fast SIMDized Kalman ﬁlter-based track ﬁt. Computer Physics Communications .

### Primary authors

Dr
Anwar Ghuloum
(Intel)
Dr
Michael D. McCool
(Intel/University of Waterloo)
R. Gabriel Esteves
(Intel/University of Waterloo)