Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs
University of California, Riverside, CA, USA
IEEE 10th International Conference on Data Mining (ICDM), 2010
@inproceedings{sart2010accelerating,
title={Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs},
author={Sart, D. and Mueen, A. and Najjar, W. and Keogh, E. and Niennattrakul, V.},
booktitle={2010 IEEE International Conference on Data Mining},
pages={1001–1006},
year={2010},
organization={IEEE}
}
Many time series data mining problems require subsequence similarity search as a subroutine. Dozens of similarity/distance measures have been proposed in the last decade and there is increasing evidence that Dynamic Time Warping (DTW) is the best measure across a wide range of domains. Given DTW’s usefulness and ubiquity, there has been a large community-wide effort to mitigate its relative lethargy. Proposed speedup techniques include early abandoning strategies, lower-bound based pruning, indexing and embedding. In this work we argue that we are now close to exhausting all possible speedup from software, and that we must turn to hardware-based solutions. With this motivation, we investigate both GPU (Graphics Processing Unit) and FPGA (Field Programmable Gate Array) based acceleration of subsequence similarity search under the DTW measure. As we shall show, our novel algorithms allow GPUs to achieve two orders of magnitude speedup and FPGAs to produce four orders of magnitude speedup. We conduct detailed case studies on the classification of astronomical observations and demonstrate that our ideas allow us to tackle problems that would be untenable otherwise.
June 14, 2011 by hgpu
