An efficient cache-oblivious parallel Viterbi algorithm

DOI10.1007/978-3-319-43659-3_42MaRDI QIDQ1693231zbMATH OpenOpenAlexFDO

Authors Pramod Ganapathi, Vivek Pradhan, Jesmin Jahan Tithi, Yunpeng Xiao, Rezaul Alam Chowdhury

Publication date 11 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43659-3_42

zbMATH Keywords

Viterbi algorithmdivide-and-conquerparallelrecursivecache-obliviouscache-efficientmulti-instancerank convergence

Mathematics Subject Classification ID

Dynamic programming (90C39) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient computing methods for parallel processing: An implementation of the Viterbi algorithm
• A parallel Viterbi decoding algorithm
• An efficient parallel algorithm for list Viterbi decoding
• Accelerating Viterbi algorithm on graphics processing units
• scientific article; zbMATH DE number 484156

Cited in

(2)

• An algorithm for the sequence alignment with gap penalty problem using multiway divide-and-conquer and matrix transposition
• Accelerating Viterbi algorithm on graphics processing units

This page was built for publication: An efficient cache-oblivious parallel Viterbi algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693231)