.png){kind=icon}
Return
Improving matrix-based dynamic programming on massively parallel accelerators
.png){kind=icon}
PRE
AI
DOI：10.1016/j.is.2016.06.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic programming techniques are well-established and employed by-various practical algorithms, including the edit-distance algorithm or the dynamic time warping algorithm. These algorithms usually operate in an iteration-based manner where new values are computed from values of the previous iteration. The data dependencies enforce synchronization which limits possibilities for internal parallel processing. In this paper, we investigate parallel approaches to processing matrix-based dynamic programming algorithms on modern multicore CPUs, Intel Xeon Phi accelerators, and general purpose GPUs. We address both the problem of computing a single distance on large inputs and the problem of computing a number of distances of smaller inputs simultaneously (e.g., when a similarity query is being resolved). Our proposed solutions yielded significant improvements in performance and achieved speedup of two orders of magnitude when compared to the serial baseline. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Parallel
Multicore
GPU
Intel Xeon Phi
Dynamic programming
Edit distance
Dynamic time warping
Journal
IF:
3.9
Papers:
2.8K
Citations:
1.8K
Organization
Cited Papers
Characterization of polymer matrix and low melting point solder for anisotropic conductive film
PREAI
ShareSave
ShareSaveTheoretical studies of inhibited gas radical addition polymerization in the absence of recombination
PREAI
ShareSaveTowards mosquito sterile insect technique programmes: Exploring genetic, molecular, mechanical and behavioural methods of sex separation in mosquitoes.png)
Acta Tropica
OAAI
Acta TropicaIF0
OAAIShareSave
View more