DTW-Based Subsequence Similarity Search on AMD Heterogeneous Computing Platform

Subsequence similarity search is one of the most common subroutines in time series data mining algorithms. According to previous studies, Dynamic Time Warping (DTW) distance is the best distance measurement in many domains. However, the high computational complexity of DTW distance makes it a critical bottleneck in many subsequence similarity search applications. In some applications, the performance of software implementation still could not meet the high requirements of applications. Under the circumstance, some hardware implementations of DTW-based algorithms were proposed in the data mining community, using GPUs and FPGAs. In this paper, we propose a full system implementation for subsequence similarity search on AMD heterogeneous computing platform, including complete normalization pre-processing, two kinds of improved lower bound for pruning, and a novel segmented parallel DTW calculation process, which efficiently utilizes the capacity of CPU and GPU on the platform. Our work achieves one to two orders of magnitude speedup compared to software implementation and several times speedup to other GPU or FPGA implementations.

[1]  Eamonn J. Keogh,et al.  Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping , 2012, KDD.

[2]  Eamonn J. Keogh,et al.  Scaling and time warping in time series querying , 2005, The VLDB Journal.

[3]  Wesley W. Chu,et al.  An index-based approach for similarity search supporting time warping in large sequence databases , 2001, Proceedings 17th International Conference on Data Engineering.

[4]  Pavlos Protopapas,et al.  Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures , 2008, The VLDB Journal.

[5]  Christos Faloutsos,et al.  Stream Monitoring under the Time Warping Distance , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[6]  Eamonn J. Keogh,et al.  Accelerating Dynamic Time Warping Subsequence Search with GPUs and FPGAs , 2010, 2010 IEEE International Conference on Data Mining.

[7]  Hui Ding,et al.  Querying and mining of time series data: experimental comparison of representations and distance measures , 2008, Proc. VLDB Endow..

[8]  Yu Wang,et al.  Accelerating subsequence similarity search based on dynamic time warping distance with FPGA , 2013, FPGA '13.

[9]  Sang-Wook Kim,et al.  Using multiple indexes for efficient subsequence matching in time-series databases , 2006, Inf. Sci..

[10]  James R. Glass,et al.  Fast spoken query detection using lower-bound Dynamic Time Warping on Graphical Processing Units , 2012, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[11]  Yasushi Sakurai,et al.  A Parallelized Data Stream Processing System Using Dynamic Time Warping Distance , 2009, 2009 International Conference on Complex, Intelligent and Software Intensive Systems.

[12]  Arvind Kumar,et al.  Implementing the dynamic time warping algorithm in multithreaded environments for real time and unsupervised pattern discovery , 2011, 2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011).