Exploiting Near-Data Processing to Accelerate Time Series Analysis
Ivan Fernandez, Ricardo Quislant, Christina Giannoula, Mohammed Alser,, Juan G\'omez-Luna, Eladio Guti\'errez, Oscar Plata, Onur Mutlu

TL;DR
This paper introduces NATSA, a near-data processing accelerator leveraging 3D-stacked memory to significantly speed up and energy-efficiently perform time series analysis, especially matrix profile computations, by reducing data movement bottlenecks.
Contribution
NATSA is the first specialized NDP accelerator for time series analysis that exploits HBM to improve performance and energy efficiency in matrix profile computations.
Findings
NATSA achieves up to 14.2x performance improvement.
NATSA reduces energy consumption by up to 27.2x.
NATSA outperforms multi-core and general-purpose NDP platforms.
Abstract
Time series analysis is a key technique for extracting and predicting events in domains as diverse as epidemiology, genomics, neuroscience, environmental sciences, economics, and more. Matrix profile, the state-of-the-art algorithm to perform time series analysis, computes the most similar subsequence for a given query subsequence within a sliced time series. Matrix profile has low arithmetic intensity, but it typically operates on large amounts of time series data. In current computing systems, this data needs to be moved between the off-chip memory units and the on-chip computation units for performing matrix profile. This causes a major performance bottleneck as data movement is extremely costly in terms of both execution time and energy. In this work, we present NATSA, the first Near-Data Processing accelerator for time series analysis. The key idea is to exploit modern 3D-stacked…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Advanced Data Storage Technologies · Graph Theory and Algorithms
