Numerical methods and programming
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Num. Meth. Prog.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Num. Meth. Prog., 2019, Volume 20, Issue 3, Pages 211–223 (Mi vmp961)  

A parallel discord discovery algorithm for time series on many-core accelerators

M. L. Tsymbler

South Ural State University, Chelyabinsk

Abstract: Discord is a refinement of the concept of anomalous subsequence of a time series. The discord discovery problem frequently occurs in a wide range of application areas related to time series: medicine, economics, climate modeling, etc. In this paper we propose a new parallel discord discovery algorithm for many-core systems in the case when the input data fit in the main memory. The algorithm exploits the ability to independently calculate the Euclidean distances between the subsequences of the time series. Computations are paralleled using OpenMP and OpenAcc for the Intel MIC (Many Integrated Core) and NVIDIA GPU platforms, respectively. The algorithm consists of two stages, namely precomputations and discovery. At the precomputation stage, we construct the auxiliary matrix data structures to ensure the efficient vectorization of computations on an accelerator. At the discovery stage, the algorithm searches for a discord based on the constructed structures. A number of numerical experiments confirm a high scalability of the proposed algorithm.

Keywords: time series, discord discovery, parallel algorithm, vectorization, OpenMP, OpenAcc, Intel Xeon Phi, NVIDIA GPU.

DOI: https://doi.org/10.26089/NumMet.v20r320

Full text: PDF file (551 kB)

UDC: 004.272.25; 004.421; 004.032.24
Received: 05.05.2019

Citation: M. L. Tsymbler, “A parallel discord discovery algorithm for time series on many-core accelerators”, Num. Meth. Prog., 20:3 (2019), 211–223

Citation in format AMSBIB
\Bibitem{Tsy19}
\by M.~L.~Tsymbler
\paper A parallel discord discovery algorithm for time series on many-core accelerators
\jour Num. Meth. Prog.
\yr 2019
\vol 20
\issue 3
\pages 211--223
\mathnet{http://mi.mathnet.ru/vmp961}
\crossref{https://doi.org/10.26089/NumMet.v20r320}
\elib{https://elibrary.ru/item.asp?id=39540775}


Linking options:
  • http://mi.mathnet.ru/eng/vmp961
  • http://mi.mathnet.ru/eng/vmp/v20/i3/p211

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Numerical methods and programming
    Number of views:
    This page:92
    Full text:33

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2022