Efficient Parallelization Using Rank Convergence in Dynamic Programming Algorithms.

This paper proposes an efficient parallel algorithm for an important class of dynamic programming problems that includes Viterbi, Needleman-Wunsch, Smith-Waterman, and Longest Common Subsequence. In dynamic programming, the subproblems that do not depend on each other, and thus can be computed in pa...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 59; no. 10; pp. 85 - 93
Autores principales:	Maleki, Saeed, Musuvathi, Madanlal, Mytkowicz, Todd
Formato:	Artículo
Publicado:	Association for Computing Machinery Oct2016
Materias:	Parallel algorithms Dynamic programming Viterbi decoding Parallel computers Computer programming
Acceso en línea:	Ver este registro en EBSCOhost